Author: Robert Hyatt
Date: 09:21:11 03/26/04
Go up one level in this thread
On March 25, 2004 at 20:40:47, Bert van den Bosch wrote:
>Hi all,
>
>Just a small question from this newly started chess programmer. I use iterative
>deepening, when the maxdepth is uneven (1, 3, ...) I tend to have satisfying
>branching factors (between 3 and 6), but in the even iterations it often goes
>above 10. Does anyone know if this is some kind of bug, or is it something that
>comes somehow naturally from the proces.
>
>greetings Bert
it is natural, particularly if you do not do many search extensions yet...
odd/even ply searches have different complexities...
To understand solve the alpha/beta node count for depth N and N+1 and N+2 and
compare the ratios:
N = W ^ floor(D/2) + W ^ ceil(D/2) + 1
for D=2, assuming W=38, you get 77
for D=3, you get 38 + 32^2 +1
4, 2 * 38^2 + 1
5 38^2 + 38^3 + 1
See how they compare...
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.