Computer Chess Club Archives




Subject: Re: double hash tables

Author: Chris Whittington

Date: 01:20:22 10/08/97

Go up one level in this thread

On October 07, 1997 at 21:05:39, Komputer Korner wrote:

>So does this mean that having a 2nd hashing algorithm kicking in when
>the hash table gets overloaded is the optimum for now?

No :)

It seems to me that at overload time this method is actually worse.

It is the effective creation of a long term and a short term memory
(whilst the hash is not overloaded) that is the advantage.


This page took 0.03 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.