Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: hash table & draw detection

Author: Robert Hyatt

Date: 09:28:12 05/01/02

Go up one level in this thread


On May 01, 2002 at 11:41:54, Arwin Smit wrote:

>Hi,
>
>I programmed a hash table for my chess engine. It seems to be faster
>and stronger now, but as far as I know the disadvantage of using a
>hashtable is that the engine will not always find the best solution
>anymore. And this is caused by not being able to see a 3-fold repetition
>draw anymore in some cases. A position may be in the hash table and
>returning a non-draw score, but it was reached in a different part of the
>search tree by repetition of positions.
>
>This worries me a bit since this is the first time I made a change to my
>engine causing it to be "non-perfect".
>Is the advantage bigger than the disadvantage?

yes it is... :)


>What is the best way to test which version is better anyway? Just let it
>play a lot of games against eachother?
>
>Arwin


That is one idea.  Better is to play a lot of games against a common set of
opponents, such as using winboard to play your engine against each of the other
winboard engines for a set number of games...

Playing against yourself only highlights the _difference_ between the two
versions.  Playing against others shows whether the difference is really
important or not...



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.