Open AccessAn algorithm for the detection of move repetition without the use of hash-keys
Author(s) -
Vladan Vučković,
Đorđe Vidanović
Publication year - 2007
Publication title -
yugoslav journal of operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.221
H-Index - 21
eISSN - 1820-743X
pISSN - 0354-0243
DOI - 10.2298/yjor0702257v
Subject(s) - computer science , hash function , repetition (rhetorical device) , algorithm , hash table , position (finance) , theoretical computer science , programming language , philosophy , linguistics , finance , economics
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