Author: Robert Hyatt
Date: 11:38:26 06/05/01
Go up one level in this thread
On June 05, 2001 at 11:38:46, Dan Andersson wrote: >>On June 04, 2001 at 22:45:44, Robert Hyatt wrote: >>> It is so close to perfectly ordered that it can be called "perfectly ordered" >>> with no danger of being wrong enough that it can be measured. >> >>Let's hope that no mathematician ever quotes you on this. ;) >> >Actually its pretty correct :) To find the perfectly ordered graph, not tree, >you need a 30-ply mini-max search and storeage space to save it and then a >backtracking seach to minimize nodecount. That will take a lot of time. And the >nearest we can come to that minimal graph, currently, is MTD(f) with ETC or >ETC^2 enhancement. In other words, the only thing to beat MTDf is enhanced MTDf. > >Regards Dan Andersson In this case, I am not even sure enhanced MTD(f) will be better. Because yoyu start off with a _Perfect_ estimate of the final score (0.00). No re-searches, no nothing. Just blazing thru the minimal tree over and over and over...
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.