Computer Chess Club Archives




Subject: Re: A New Approach to Draw Detection by Move Repetition in Computer Ches

Author: Paul Clarke

Date: 03:46:50 07/30/04

Go up one level in this thread

On July 29, 2004 at 11:20:29, Christophe Theron wrote:

>On July 29, 2004 at 07:46:08, Paul Clarke wrote:
>>2) Their code seems to analyse the complete move list (since the last
>>irreversible move) each time. I can't see any problem with building the
>>concatenation list incrementally, you just need to undo the effect of the
>>current move when returning from the search.
>Their algorithm allows you to answer the question "is the current position the
>same as the one at the beginning of the tested string?". It would work forward
>or backwards, so the "start" of the tested string can as well be the end of the
>list if you wish (that's how they use it).
>So you need to start from the current position (the one you reach at the end of
>your search) and move backwards until you either find an irreversible move or a
>If you always start at the last reversible move and move forward, building the
>concatenation list incrementally for exemple, you are only going to answer the
>question "is the current position the same as the position before the last
>reversible move". You will not notice a repetition that has happened in between.

Good point - thanks.

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.