parallel search speed measurement

Discussion of chess software programming and technical issues.

Moderator: Ras

Dann Corbit
Posts: 12799
Joined: Wed Mar 08, 2006 8:57 pm
Location: Redmond, WA USA

Re: parallel search speed measurement

Post by Dann Corbit »

Lazy SMP gives better Elo, but clearly does not get as deep as quickly.
The new Stockfish loses several plies in the same amount of time on an hour search compared to the traditional search version.
Taking ideas is not a vice, it is a virtue. We have another word for this. It is called learning.
But sharing ideas is an even greater virtue. We have another word for this. It is called teaching.
User avatar
Laskos
Posts: 10948
Joined: Wed Jul 26, 2006 10:21 pm
Full name: Kai Laskos

Re: parallel search speed measurement

Post by Laskos »

Dann Corbit wrote:Lazy SMP gives better Elo, but clearly does not get as deep as quickly.
The new Stockfish loses several plies in the same amount of time on an hour search compared to the traditional search version.
I don't understand why Lazy SMP gives better ELO. According to this test with Arasan 19 testsuite, the effective speed-up is worse than that of Crafty 25. Depth is irrelevant, as for Komodo and Stockfish I just counted the number of solutions and time to solutions. It is possible that tactical testsuite approach is wrong.