Author: Dan Andersson
Date: 06:00:14 11/25/00
Go up one level in this thread
MTDf will always use a zero width search, sometimes many times but that will often be faster than a full window re-search. And the funny/beautiful thing is that MTD is equivalent to a best-first algorithm named SSS*. http://theory.lcs.mit.edu/~plaat/mtdf.html
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.