Author: Andrew Williams
Date: 15:07:01 07/03/03
Go up one level in this thread
On July 03, 2003 at 12:28:05, Ralph Stoesser wrote: >Dear chess programmers, > >What are your personal experiences with the MTD(f) search introduced by Aske >Plaat some years ago? > >Best regards, >Ralph My program has used this almost since I started it. My view is that _as long as you have a large hash table_, it will be about the same as a PVS implementation. It is *very* sensitive to move ordering. It is a bit tricky to extract a PV, as you generally get it from the hash table. If you read this article, you'll see that Fabien Letouzy has an idea for how to get the PV without using the hash table. I've never tried it. http://fortuna.iasi.rdsnet.ro/ccc/ccc.php?art_id=251543 Here is a description I posted years ago: http://fortuna.iasi.rdsnet.ro/ccc/ccc.php?art_id=71001 Nowadays, my program's mtdf() function doesn't look much like the one I included. Another program that uses MTD(f) is Rudolf Huber's SOS. Andrew Williams
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.