Author: Gian-Carlo Pascutto
Date: 06:17:50 11/25/00
Go up one level in this thread
On November 25, 2000 at 08:10:42, Severi Salminen wrote: >How can this blending be done? Take a look at both algorithms and compare them. >So what _is_ the difference between NegaScout and MTD(f)? MTD is sort of a 'search driver'...it repeatedly calls the main search algorithm (which can be, for example, a NegaScout algorithm) with different zero-windows to establish new search bounds and eventually the true value. MTD(f) (actually MTD(n,f)) is a specific sort of MTD searcher, and the most efficient known currently. -- GCP
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.