Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: question about speed in hash tables

Author: Uri Blass

Date: 05:10:16 10/17/02

Go up one level in this thread


On October 17, 2002 at 08:08:06, Uri Blass wrote:

>On October 17, 2002 at 08:04:44, Vladimir Medvedev wrote:
>
>>
>>>risk of 1/500000 in wrong repetition detection is not something that I agree to
>>>accept.
>>
>>You can check for ( SearchRepetitions[...]==3 ) instead of "==2".
>>Then you will get a wrong score (= DRAW) only if you have TRIPLE collision.
>>
>>Probability is 1/(500000 * 500000).
>
>The main problem is not wrong repetition detection in declaration but wrong
>repetition detection in the search and in the search second repetition is
>evaluated as a draw.
>
>Uri

Correction first repetition.
I mean second time that the same position appears.

It is possible that it is better not to do it always but even programs that do
not do it always evaluate repetition of position that did not appear in the game
as a draw.

I decided to evaluate every repetition as a draw because it is more simple.

Uri



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.