Author: Gian-Carlo Pascutto
Date: 11:55:48 08/21/02
Go up one level in this thread
On August 21, 2002 at 14:48:26, Robert Hyatt wrote: >I just computed the branching factor for every iteration that was completed, >leaving off the first one since I had nothing to compare it to (first one for >each search). I added them all upp and divided by N, and got something just >under 4.0... > >Anybody can do that again, rather than producing disinformation... This doesn't work. All that is printed are search times, not node counts. The paper literally says that at small depths not all cpus are used. Hence, when comparing the plies and only looking at times, you are missing the variable of more cpus kickin in. You can't use this to determine the branching factor of their search. -- GCP
This page took 0.01 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.