Author: Vladimir Medvedev
Date: 05:48:36 05/13/02
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.