Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Search instabilities when re-using hashtables

Author: Robert Hyatt

Date: 08:23:27 06/17/02

Go up one level in this thread


On June 17, 2002 at 01:02:17, Gian-Carlo Pascutto wrote:

>On June 16, 2002 at 23:23:34, Robert Hyatt wrote:
>
>>There is _no_ solution if you want to reuse the old values (I do this
>>also).  You just have to accept the instabilities as a part of this reuse
>>approach...
>
>Hmm, I always thought Crafty cleared the hash on each move. In any
>case, I can't remember seeing a fail low/fail high combination in
>Crafty, so it certainly doesn't seem to suffer a lot from this...
>
>--
>GCP


Crafty doesn't clear the hash table between moves.  With a couple of
exceptions...  If something significant changes so that some scoring terms
are updated, then the _scores_ are marked invalid in the hash table.  But the
best move is kept.

fail high and fail low happens regularly.  Just look thru a log file and
notice all the "++" lines.  Look for a ++ line followed by a -> line which
says the search failed high, then failed low, and the iteration completed.

That isn't uncommon nor can it be stopped without clearing the hash between
searches..



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.