Author: Robert Hyatt
Date: 18:44:30 05/06/04
Go up one level in this thread
I re-read your stuff. I think the way you did the calculation was a bit more favorable than the way I do it. IE I always use the _last_ PV produced by the 1-cpu search, and the time for that _same_ PV on the N-cpu search. The first move is more difficult to search in parallel than the remainder of the ply-1 moves... that is why I split at the root when possible in fact. But, as the saying goes, you can prove nearly anything depending on how you choose to interpret data. Your interpretation is hardly invalid... And might sometimes be more favorable rather than less. Who knows...
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.