Author: Mogens Larsen
Date: 10:44:50 04/25/00
Go up one level in this thread
On April 25, 2000 at 13:38:01, Christophe Theron wrote: >You were right but you did learn something. :) > >SSS* is really the name of a search algorithm. It has been demonstrated to be >equivalent (under the right conditions) to a class of the the MTD(f) algorithms >(this has been demonstrated by Aske Plaat). > >MTD(f) is used by several chess programs in the world, including the french >program AnMon by Christian Barreteau and one program from Don Daley (I forgot >the name of the program, isn't it OCCAM?). > >MTD(f) requires a lot of hash tables and is more efficient than the classical >PVS/NegaScout algorithm (used by most top chess programs at this time). But >MTD(f) is more difficult to implement because it interferes with the selection >algorithms generally used in chess programs. > > > > Christophe Thanks for the info. Being right _and_ learning something. This is almost to good to be true :o). Best wishes... Mogens
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.