Author: David Rasmussen
Date: 10:00:28 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 Half the plies would be "all"-nodes and the other half would be "one"-nodes. I'm assuming an extremely simple theoretical situation with no q-search etc. So this would be of the order 4*40 = 160 I would think. Maybe I'm wrong. /David
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.