Computer Chess Club Archives


Search

Terms

Messages

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

Author: Paul Clarke

Date: 04:46:08 07/29/04

Go up one level in this thread


On July 29, 2004 at 06:26:52, Gian-Carlo Pascutto wrote:

>http://arxiv.org/ftp/cs/papers/0406/0406038.pdf
>
>I stumbled onto this when doing a search for Axon.
>Not seen it mentioned here yet.

Cute algorithm, though I'd like to have seen them test it against a more
conventional approach instead of testing it against a version of Axon with no
repetition detection. A couple of other thoughts:

1) Do any engines really do full board comparisons to detect repetition? I'd
have thought comparing Zorbrist signatures would be reliable enough.

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.



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.