Author: Vincent Diepeveen
Date: 06:31:53 05/13/02
Go up one level in this thread
On May 13, 2002 at 08:48:36, Vladimir Medvedev wrote:
there must be bugs then in your hashtables.
- did you check the key with a non incremental verification function?
- do you store things like
a) bound
b) depthleft to search
c) score of search
Another thing can cause huge instabilities, that's if you forward prune
and combine that with hashtables and nullmove.
>I'm going to implement hashtables in GreKo (they will be in ver. 0.42, now I'm
>testing their work).
>
>The question is, how to manage hashtables while iterative deepening is used?
>Now I clear hashtable on each iteration, because holding them unchanged since
>last iteration causes search instability. But I feel that I lose some useful
>information this way...
>
>Please, could anybody give me some information, weblinks or advice on this
>technique?
>In addition to http://www.seanet.com/~brucemo/topics/hashing.htm, which is the
>main knowledge source for me now?
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.