Author: Robert Hyatt
Date: 12:12:19 01/09/02
Go up one level in this thread
On January 09, 2002 at 12:50:12, David Hanley wrote: >I have seen it claimed somewhere that with perfect move ordering, an eight ply >search would only consume a thousand nodes or so, even only alphabeta ( no >hashing or forward pruning ). > >Is this so? > >dave Not necessarily. The _exact_ formula is N=W^floor(D/2)+W^ceil(D/2) W is the branching factor, or number of legal moves at a ply (yes, it is an average value for chess, and the typical value is 38). D is the search depth in plies floor means to "round down" ceil means to "round up" If D is even, then a simpler representation is N = 2 * W^(D/2) N is the total nodes searched...
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.