Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: A fast hash -- assuming you are not planning to do incremental updates

Author: martin fierz

Date: 02:09:35 06/15/01

Go up one level in this thread


On June 15, 2001 at 02:40:15, Dann Corbit wrote:

>Suppose that you have a chessboard represented as 64 characters, and you want to
>make a hash from it.  This works well, if you make a 64 bit hash by hashing the
>first 32 characters and then the second 32 characters to make two 32 bit chunks.
> It was quite a bit faster than Zobrist hashing.  On the other hand, it cannot
>be used to do incremental updates, so you might be sorry you used it if you
>decide to go that route.

one of the best checkers programs (kingsrow by ed gilbert) uses this hash
function. ed wrote me once that this was faster than zobrist. i have
never tried it myself.

cheers
  martin



This page took 0.07 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.