Author: Antonio Dieguez
Date: 08:43:33 04/23/01
Go up one level in this thread
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. >In my chessprog, I'm using an Alpha-Beta-Search with an infinite window. After >adding a hashtable, only half of the nodes need to be searched, but I get still >a branching factor around 9. The use of Iterative Deepening didn't change much. >So now my question is what can I do to improve the search? Should I try to >improve the move-sorting? Or is it necessary to use other pruning techniques >like Nullmove? > >Thanks > >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.