Author: Stuart Cracraft
Date: 21:42:10 06/25/04
Go up one level in this thread
On June 25, 2004 at 21:26:43, Robert Hyatt wrote: >On June 25, 2004 at 16:55:47, Stuart Cracraft wrote: > >>On June 25, 2004 at 16:46:31, Dann Corbit wrote: >> >>>What is your branching factor? >>> >>>The best programs have a branching factor between 2 and 3. >>> >>>If you already have a branching factor in that range, do not expect any more >>>really dramatic speedups. >> >>This seems like a very useful measure to implement but I am not >>sure how it might be done. >> >>Take the # of total legal moves searched at each node (prior >>to cut) and divide by the total number of nodes searched across >>all nodes? >> >>Time between iterations in mine goes up about 2x >>to 6x per iteration but this is obviously a different measure >>than what you are suggesting. > >Compute the time for iteration N+1 divided by time for iteration N. This gives >the "effective branching factor" which is the number Dann was talking about... > >2.0-3.0 is reasonable. You can always test against Crafty on the same position >for a quick reference... Mostly between 1.85 and 7 with an occasional blowup to doubledigits...
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.