Author: Dan Andersson
Date: 11:42:09 03/29/04
Go up one level in this thread
On March 29, 2004 at 14:25:13, Robert Hyatt wrote: >On March 29, 2004 at 11:14:29, Dan Andersson wrote: > >> The Plaat paper concerns AB with memory. You won't get the half size tree by >>100% perfect ordering. You must get the right cutoff moves also. >> >>MvH Dan Andersson > > >I wasn't talking about the plaat paper at all. > >But the rest of your statement I don't follow. If I have perfect move ordering, >I will absolutely search the minimal tree space. That is by definition, true... It is a truth with caveats. I refer you to Knuths 'Selected Papers on Analysis of Algorithms', 'An Analysis of Alpha-Beta Pruning', Theorem 2 page 120. There is even a nice figure that shows an example. MvH Dan Andersson
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.