Author: Rafael Andrist
Date: 09:04:05 04/23/01
Go up one level in this thread
On April 23, 2001 at 11:43:33, Antonio Dieguez wrote: >A branching factor around 9 is too high for an alphabeta-search even without >prunning and without hashtable. Why are you using infinite window? try using >small and null windows and see what happen first. >Anyway you say "The use of Iterative Deepening didn't change much" so before how >you calculated the branching factor? The definition I use is nodes iteration >x+1/nodes iteration x, if you are using the other definition that I don't >renember wich is, please forgive my unusefull post. I calculate a virtual branching factor, which is the same for each depth (in reality, it's different). b := branching factor d := depth n := nodes b = n ^ (1 / d) so b ^ d gives n [the ^ means the power function, not the ANSI-Xor] Rafael B. Andrist
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.