Computer Chess Club Archives




Subject: Re: Question for the MTD(f) experts

Author: Tord Romstad

Date: 02:38:17 04/14/04

Go up one level in this thread

On April 14, 2004 at 05:32:37, Richard Pijl wrote:

>>So my next question is, how do you normally populate a hash table with PV nodes,
>>since we only get edge values during the search?  Do I need to follow the pv
>>from hash to hash with a makemove for each succeeding pv node?
>In addition to storing the move that gets a fail high, you could also store the
>bestmove (i.e. score with highest value below alpha) in the hashtable. This only
>makes some sense with fail soft. With fail hard (as TSCP is) you will (almost)
>always get alpha as best value so the chosen move will be random.
>That way you will be able to construct an estimation of the pv, which will
>improve with each iteration.

Does this really work for you?  I once tried it, and the results were ugly.  In
my experience, it is never a good idea to store a best move except when failing


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.