Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: MTD(f)

Author: Stuart Cracraft

Date: 07:14:28 07/28/04

Go up one level in this thread


On July 28, 2004 at 08:06:08, Alessandro Damiani wrote:

>>Googling around for MTD(f) is remarkably sparse as far as amount of practical
>>examples are concerned.
>>
>
>A buddy wrote the engine Cilian which is based on MT. If I remember right he
>improved MT at the top-level by looking at score intervals to determine the best
>move. This way he could speed up the search at the cost of not knowing the whole
>PV (only best move at the root is known).
>
>On his homepage (http://membres.lycos.fr/milin) click on "Computer Chess -
>CILIAN - a MT based searcher" and "Vortrag" to read about his ideas and results.
>
>You also can download the source code, but since it is password protected you
>may ask him to get the password.
>
>Alessandro

Seems to me his research is flawed due to the admission that measured
gains included results of history heuristic, null move, etc.






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.