Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: MTD(f)

Author: Robert Hyatt

Date: 14:40:02 12/17/05

Go up one level in this thread


On December 17, 2005 at 16:22:31, Engin Üstün wrote:

>Hi,
>who did experimented with MTD(f) in C or C++ ?
>does it works ?
>is it really faster then PVS ?
>
>And other question, is there any papers or examples in C or C++ exist ?
>
>on ther page http://www.cs.vu.nl/~aske/mtdf.html i did not really understand the
>pascal code.
>
>bye,
>Engin


I played with it for about 6 months after Don D. (socrates, etc) started talking
about how well it worked.

There are issues.

Convergence can take several iterations, the more iterations, the quicker your
tree size passes normal PVS and it begins to cost rather than save you.

There are quite a few internal mods you need to add that you don't necessarily
need for normal PVS.  You need to store both upper and lower bounds in the hash
table.  You really need to consider ETC even if you don't do it in your PVS
program (I don't).

Some swear by it.  Some swear at it.  You pay your money and take your chances.
It works quite well for some.  It didn't for me...




This page took 0.05 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.