Author: Dave Gomboc
Date: 21:54:32 12/09/99
Go up one level in this thread
On December 09, 1999 at 16:30:29, Dann Corbit wrote: >On December 09, 1999 at 16:21:22, Daniel Clausen wrote: >[snip] >>>How are collisions handled? Do you compute the value for the current key and >>>replace or??? >> >>Depends: >> >>Storing a value into the HT: >> If the depth of the position in the HT is less then the current depth, I >>overwrite. >How do you know that the deeper one is more important than the shallow one? It >seems to me that a shallow one might be examined again and again, and a deep one >might be some chance leaf search of little value. You don't. It's a heuristic, and can be wrong. >Has anyone tried using an equivalent algorithm to a LRU cache for hash values, >but instead of flushing to disk, just discarding the unused entries? The default is to overwrite, not to store on disk. Maybe I am misunderstanding your question. Dave
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.