Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Fast hash key method - Revisited!

Author: Robert Hyatt

Date: 13:54:10 01/14/98

Go up one level in this thread


On January 14, 1998 at 15:10:16, Tony Warnock wrote:

>Rather than using random numbers one can use error-correcting code
>values. This is explained in an old article in the ICCA magazine by Burt
>Wendroff and me. (I do not have an electronic version unfortunately.)
>This gives a bit more protection against collision. It is equivalent in
>our case to doing a big parity check. The mechanics are identical to the
>random scheme. The entries in the tables are different. Our tests showed
>a slight improvement.
>
>                                          Tony


Tony... long time, so see.  Last time I saw you was when the famous
"no need to underpromote a pawn" game blew up, in Albuquerque I think.
In any case, good to see you are still around, and now visiting here.

Bob




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.