Author: Robert Hyatt
Date: 10:28:20 09/01/02
Go up one level in this thread
On September 01, 2002 at 03:20:20, Gian-Carlo Pascutto wrote: >On August 31, 2002 at 23:54:31, Robert Hyatt wrote: > >>Interesting question. Deep Blue essentially used it in the chess hardware, >>which means the last software ply was a sort of mtd(f) search. > >Except that it was missing the 'm' in mtd(f), which made it horribly >inefficient. > >-- >GCP I don't agree. They simply had a piece of hardware that could search a null-window tree, and nothing else. Which is all a single search in a single iteration of mtd(f) can do. The software provided the "m" at the point where the software handed things off to the hardware... I don't particularly like mtd(f) but it does appear to work. Good enough to beat Kasparov and lots of other programs too, and several current engines are using it with good results...
This page took 0.01 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.