Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hashkey collisions (typical numbers)

Author: Renze Steenhuisen

Date: 07:26:01 04/07/04

Go up one level in this thread


On April 07, 2004 at 10:18:36, Vincent Diepeveen wrote:

>On April 07, 2004 at 10:16:26, Renze Steenhuisen wrote:
>
>>>It will be some simple bugs by Renze.
>>
>>A simple bug to create, can be a hard bug to find and solve!
>>
>>>>For reference, my program gets:
>>>>Checking minimum hamming distance between random keys: 14 bits
>>>>Checking average hamming distance between random keys: 31 bits
>>
>>This looks strange to me, I would guess that minimum and average are much closer
>>together than 14 and 31 are, but my knowledge Cryptography is somewhere back in
>>my memory (from about 2 years ago...)
>>
>>My guess is that minimum HD = 14, and an average HD = 31, is suboptimal. But
>>don't nail me to a cross if I'm wrong!
>>
>>Cheers!
>>   Renze
>
>Making a chessprogram is especially for european programmers a big 'learn how to
>debug course' :)

Why do you say _EUROPEAN_ programmers? Is it because we aren't just to
programming, or is it because we aren't used to bugs?

Hi Vincent!



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.