Computer Chess Club Archives

Search

Terms

Messages

Subject: Hash Replacement

Author: Alex Boby

Date: 14:03:27 05/14/01

  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

Re: Hash Replacement José Carlos 05:48:34 05/15/01
Re: Hash Replacement Robert Hyatt 15:38:48 05/14/01
Re: Hash Replacement Dann Corbit 15:17:14 05/14/01

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.