Author: Christophe Theron
Date: 10:38:01 04/25/00
Go up one level in this thread
On April 25, 2000 at 08:07:16, Mogens Larsen wrote:
>On April 24, 2000 at 17:01:48, Mogens Larsen wrote:
>
>>On April 24, 2000 at 15:28:47, Christophe Theron wrote:
>>
>>>SSS* is the name of a search algorithm.
>>>
>>>I wanted to know if this is a different version of Fritz.
>>
>>Well, I learn more from day to day it seems. And yes, it is a different version
>>of Fritz. Multiple CPU version AFAIK.
>>
>>Best wishes...
>>Mogens
>
>I retract my statement about learning anything, since I was right in the first
>place.
>
>Best wishes...
>Mogens
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
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.