Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: MTD(f) Problems

Author: martin fierz

Date: 00:58:01 04/11/02

Go up one level in this thread


On April 11, 2002 at 02:22:55, Alejandro Dubrovsky wrote:

>On April 10, 2002 at 21:02:51, Dann Corbit wrote:
>
>>On April 10, 2002 at 19:40:45, Matthias Gemuh wrote:
>>
>>>Almost everyone here speaks AlphaBeta :(.
>>
>>Vincent uses MTD(f), IIRC.
>>Smallpotato's author uses MTD(f).
>>KnightCap uses MTD(f).
>>
>>There are maybe 6-7 others who like it.
>
>I use it, but i don't like it. Search instabilities seem harder to handle. Next
>version of smallpotato will probably switch to aspiration search.
>
>Alejandro

i use MTD in my checkers program. it searches smaller trees,  but also has
drawbacks. i agree on the search instabilities, and AFAIK, you cannot get a PV
with MTD - which makes understanding why it played a move harder... or is there
a way to get a PV?



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.