Author: Ernst A. Heinz
Date: 15:32:12 11/01/00
Go up one level in this thread
Hi Pham, >[...] Therefore, I tried to calculate the >number of nodes in critical trees. I found the simple formula in the >book "AI" of Patrick Henry Winston as the following: > > s = 2 * b ** (d/2) - 1 for d even. You do not need to look elsewhere for the desired formula. My book gives it on page 16. B ^ ceil(H / 2) + B ^ floor(H / 2) - 1 where "B" denotes the uniform branching factor and "H" the uniform height of the critical alpha-beta tree in question. Please beware that the formula does not quantify the whole number of nodes in the critical tree. It equals the number of horizon nodes only. Hence, you must sum over 1 to H in order to calculate the overall number of nodes in critical alpha-beta trees. =Ernst=
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.