Author: Robert Hyatt
Date: 11:25:13 03/29/04
Go up one level in this thread
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...
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.