Author: Robert Hyatt
Date: 08:18:35 05/13/02
Go up one level in this thread
On May 13, 2002 at 08:48:36, Vladimir Medvedev wrote: >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 > You lose a _lot_ of information this way. Don't clear the hash tables at all if you can avoid it. And if you _do_ clear the stuff, it is best to just clear the score field but not destroy the entry itself, since the "best move" is still a good move to try... 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.