Author: Ricardo Gibert
Date: 18:27:56 03/25/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 IIRC, in alphabeta with optimal move ordering and constant BF, the EBF (=Effective Branching Factor) varies between BF/2 and 2 except at the root where EBF = BF. Things are a little different in the case the value of the position is + or - infinity. In practice, pruning, extensions, qsearch, etc. muddy things up quite a bit, but the pattern can still be noticeable.
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.