Author: Stuart Cracraft
Date: 08:18:29 08/01/04
Go up one level in this thread
On August 01, 2004 at 04:28:11, Volker Böhm wrote:
>Hi,
>
>I use a two stage hash table.
>
>For a calculated index "i" do do the following:
>
>i &= ~1; // allways an even number
>
>if (CurrentDepth >= HashDepth(i))
>{
> Hash(i + 1) = Hash(i)
> Hash(i) = current
>}
>else
>{
> Hash(i + 1) = current
>}
>
>to get an hash entry:
>
>i &=1;
>
>if (Key(i) == Current_Key)
>{
> try to use Hash(i)
>}
>else if (Key(i+1) == Current_Key)
>{
> try to use Hash(i+1)
>}
>
>Greetings Volker
How much better (can you quantify?) is this 2-tier than single-tier?
Stuart
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.