Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Efficient hash algorithm?

Author: John Coffey

Date: 17:49:18 09/21/98

Go up one level in this thread


On September 21, 1998 at 20:32:51, Dan Newman wrote:

>Many of us believe that a two level hash table (each entry having two
>slots, one always replace, the other replace if the draft (depth searched)
>is greater) works well on the PC--perhaps better than anything else tried
>so far...
>
>Re-hashing can also work well depending on the architecture of the machine.
>I think Bob Hyatt has said that Cray Blitz "re-hashes" up to 7x, for
>instance (he's able to grab all 8 entries in one go).
>
>-Dan.
>

What is meant "re-hashes up to 7x?"

Why would the two slot method work best?   You would take twice as much space
and have to look at twice as many entries?  What if your dual entries have
conflicting information for the same nodes?

John Coffey



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.