Author: leonid
Date: 19:02:22 10/24/00
Hello! Is the formula for ideal branching factor by brute force search simple or complicated? Could it be computed as: "Square of average number of moves in each ply". If, for instance, we have average number of nodes in each ply 25, then branching factor is: 25^=5 (effective branching factor is 20%) If number of average moves is 30 then: 30^=5.477 (effective branching factor is 18.25%) and so like. Also, I speak about search where all complications of move ordering is present as well as alpha-beta. But extensions, hash table, null move and so like are not in the program. Thanks for response! Leonid.
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.