Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question about hash tables

Author: Robert Hyatt

Date: 15:38:48 10/19/99

Go up one level in this thread


On October 19, 1999 at 18:27:39, Daniel Clausen wrote:

>Hi
>
>On October 19, 1999 at 07:39:22, Andrew Williams wrote:
>
>>I use the whole 64-bit hashkey for the checksum in PostModernist. 64 bits seems
>>pretty safe, but I also check the move coming from the table to make sure that
>>the piece on the from square can legally move to the to square etc etc. I'm sure
>>that this is overkill, but I tend to prefer to be overcautious with my program.
>>Producing another 64-bit hash key using different random numbers would be an
>>alternative way of being overcautious, but I'm pretty sure it would be a lot
>>slower.
>>
>>Andrew
>
>Um.. maybe I misunderstood something, but why do you think it's overkill
>to test whether the move from HT is legal? I mean if it's not legal,
>you end up with a wrong/inconsistent board which seems to be a disaster IMO.
>
>Kinds regards,
> -sargon


Absolutely right.  Illegal moves (for me) happen maybe once per year.  But
when they do, they would lose the game as the board would be corrupted and
there is no easy way to fix it...



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.