An Algorithm for the Detection of Move Repetition Without the Use of Hash-Keys

Yujor, Vol. 15, No. 2, pp. 273-288, 2007

16 Pages Posted: 2 Nov 2010

See all articles by Djordje Vidanovic

Djordje Vidanovic

University of Niš, Faculty of Philosophy

Vladan Vuckovic

University of Niš

Date Written: November 1, 2010

Abstract

This paper addresses the theoretical and practical aspects of an important problem in computer chess programming – the problem of draw detection in cases of position repetition. The standard approach used in the majority of computer chess programs is hash-oriented. This method is sufficient in most cases, as the Zobrist keys are already present due to the systemic positional hashing, so that they need not be computed anew for the purpose of draw detection. The new type of the algorithm that we have developed solves the problem of draw detection in cases when Zobrist keys are not used in the program, i.e. in cases when the memory is not hashed.

Keywords: Theory of Games, Algorithms, Computer Chess, Repetition of Draw Detection

Suggested Citation

Vidanovic, Djordje and Vuckovic, Vladan, An Algorithm for the Detection of Move Repetition Without the Use of Hash-Keys (November 1, 2010). Yujor, Vol. 15, No. 2, pp. 273-288, 2007 , Available at SSRN: https://ssrn.com/abstract=1701409

Djordje Vidanovic

University of Niš, Faculty of Philosophy ( email )

Cirila i Metodija 2
18000 Niš
Niš, 18000
Republic of Serbia

HOME PAGE: http://www.ni.ac.rs

Vladan Vuckovic (Contact Author)

University of Niš ( email )

Univerzitetski trg 2
Nis, 18000
Republic of Serbia

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
45
Abstract Views
534
PlumX Metrics