Author: Robert Hyatt
Date: 15:38:48 05/14/01
Go up one level in this thread
On May 14, 2001 at 17:03:27, Alex Boby wrote: > As a hash replacement scheme I have 2 tables, one replace all collisions, the >other only if the depth is greater (or equal but better type). > > After a bunch of games in a row, it seems that the latter table gets full up >and is rendered more or less useless. So I think I need more flexibility for the >replacement. I considered adding a 'staleness' value so that the records are >replaced after N failed attempts. But I have no idea what I should set N to and >I'm not really fond of this idea anyways. > > I'm now thinking about just clearing the second hash table after every game. >Is this an effective strategy? > >Thanks for your input. >Alex Most everybody uses an "age" field. If a position was stored in the current search, only overwrite if the draft is better. If a position was stored in a prior search, overwrite it when given the chance (or move this to the always store table, then overwrite the depth-preferred entry).
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.