Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: About debugging HashTables implementation .

Author: Vincent Diepeveen

Date: 03:56:18 04/08/02

Go up one level in this thread


On April 07, 2002 at 14:09:04, John Marountas wrote:

first check whether you hash correctly by non-incremental checking
of it.

secondly use a bound.

also be sure you get correct scores out of hashtable. conversion
signed to unsigned usually most programmers make mistakes with it.

>Hello !
>
>I have implemented HashTables (at Pyotr Club Edition) using the Zobrist key but
>Pyotr randomly makes unexplained blunders.
>
>If I disable HashTables then Pyotr plays other moves.
>
>It seems that I have made  a wrong implementation. But how can I prove it ?
>I cannot find a bug in my code. Is there any test suite which can help me?
>
>Any suggestion welcome !
>
>This is the problem which delays the release of the Club Edition ! :-(
>
>Thanks,
>Marountas John



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.