Computer Chess Club Archives




Subject: Re: Hash Collisions (Dan)

Author: Larry Griffiths

Date: 11:43:29 02/23/99

Go up one level in this thread

On February 23, 1999 at 14:33:03, Larry Griffiths wrote:

>I read your post on hash collisions.  I have tried some hamming distance
>code and I see little difference when compared to generating random
>numbers.  I have been thinking of writing code that does what you said
>where 64 bits must have 32 bits (or 50%) turned on in each number.  I also see
>where there are many references to the 12 pieces times 64 squares = 768
>hash codes.   Pawns only use 48 squares for each side, so 32 squares are unused by pawns.

Forget my reference to the Bishops.

>768-48 leaves 720 hashcodes for the piece square table.
>Food for thought?  Errors in my thinking?

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