Author: Gian-Carlo Pascutto
Date: 10:55:45 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 ). no hashing or pruning with perfect ordering can be described by bf = branching factor = 38 nodes = (bf)^ceil(depth/2) + (bf)^floor(depth/2) - 1 for an 8 ply search, that is 4 170 271 nodes -- GCP
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.