Author: Andrew Williams
Date: 11:45:13 12/13/00
Go up one level in this thread
On December 13, 2000 at 14:15:06, martin fierz wrote: >hi, > >after reading the description of mtd(f) it seemed to me that this kind of >algorithm could only work if the whole tree still fits in the hashtable, and It's not necessary to have the whole tree in the hash table. Because of all the re-searches, a large hash table is desirable. >that once it doesnt fit in any more it would get terribly inefficient. is this >right or wrong? are there any chess programs using mtd(f)? i once read that the There are a few. My program (PostModernist) is one. Other people here are developing MTD(f) programs too. >most popular search is PVS where the first move gets searched normally and all >others with a minimal window - is this correct? > I'd guess that aspiration search or PVS is the most popular. >cheers > martin Andrew
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.