Author: Tijs van Dam
Date: 07:48:41 01/26/00
Hello, Very often I read about "my branch factor is ...", or "my program calculates ... nodes per second". It is not always clear to me what is meant here, especially on the topic of fail-high percentages. Speed: * Do you count quiescence nodes in the number of nodes per second? Fail high: * Do you count quiescence nodes that fail high because one of the moves is very good? * Do you count quiescence nodes that you skip because Eval()>beta? * Do you count nodes that you don't search further because SearchNullMove()>beta? * Do you count those nodes as "fail high on the first move"? * Do you count nodes that you skip because HashProbe()>beta? Branch factor: * Is this - the average quotient of the number of nodes searched in a ply and the previous, or - the average quotient of the number of nodes searched in the last completed ply in a search and the one before? Quiescence: * Do you count leaf nodes of the normal search, thus the "root nodes" of quiescence search, as quiescence nodes? Greetings, Tijs van Dam
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.