Author: Dann Corbit
Date: 15:16:53 12/19/05
Go up one level in this thread
On December 19, 2005 at 17:58:53, Dann Corbit wrote: >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 ? > >It does work. > >>is it really faster then PVS ? > >I think the answer to that question is no. > >>And other question, is there any papers or examples in C or C++ exist ? > >There are a few examples around. I recall that SmallPotato was MTD(f) in its >earlier incarnations. You can also find MTD(f) code for other zero sum games >like Mancala and Othello in C and C++ (which would be practically identical to >that for Chess). > >>on ther page http://www.cs.vu.nl/~aske/mtdf.html i did not really understand the >>pascal code. > >The most successful MTD(f) engine is probably SOS and after that perhaps >PostModernist. > >Perhaps Rudolf Huber or Andrew Williams could be a helpful resource for specific >questions. > >Also Tord Romstad has worked extensively with MTD(f), although I do not know >which versions of his engine Gothmog used one technique or the other. I guess >that he may be able to answer specific inquiries also. > >One interesting plus to the MTD(f) framework is that you can use it for generic >experimentations (e.g. MTD(f) and C* algorithms can use the same searcher and a >slight difference in the test driver). > >There is a paper on a generic driver that can be used to model all sorts of >search paradigms but I don't remember the name of it. > >For sure, that is worthwhile to play with, if just for the fun of it. Here is the paper I was thinking about: http://citeseer.ist.psu.edu/plaat96bestfirst.html
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.