Computer Chess Club Archives




Subject: Re: MTD(f) and hash table size

Author: Dan Andersson

Date: 15:34:26 08/16/03

Go up one level in this thread

 Depth new >= depth old is a pretty crappy replacement scheme IMO. You risk
filling the hash with worthless nodes. And that will kill MTD(f) as it will mean
you have to do the same work repeatedly in the new null window search, and it
may harm other search implementations. I actually prefer a repalce always scheme
to that one.
 Better to use a two slot scheme. Probe both slots for a hit. One slot is always
replace the other is depth or deeper. If you don't get a hit you replace
according to the two schemes.

MvH Dan Andersson

This page took 0.31 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.