Author: Robert Hyatt
Date: 14:55:44 08/21/02
Go up one level in this thread
On August 21, 2002 at 17:32:11, Gian-Carlo Pascutto wrote: >On August 21, 2002 at 17:25:23, Robert Hyatt wrote: > >>And it is just as accurate >>as trying to count nodes. > >It isn't, because the NPS changes, which is just what I said. > >-- >GCP It doesn't change _that_ much on the last 3-4-5-6 searches. At least it doesn't for me in the results from Cray Blitz on 16 and 32 cpus... Once those two programs get to the 1-2 second mark, the cpus stay busy, period. Just like Crafty. I don't believe DB had any such problem either, once you get beyond the first search result they outputted for a iteration... You could test your hypothesis however, by seeing if the first couple of branching factors are worse than the last couple for each search... If they are similar, this isn't a problem... I might try this tonight late, for one log file...
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.