| Article ID: | iaor2009499 |
| Country: | Serbia |
| Volume: | 17 |
| Issue: | 2 |
| Start Page Number: | 257 |
| End Page Number: | 274 |
| Publication Date: | Jul 2007 |
| Journal: | Yugoslav Journal of Operations Research |
| Authors: | Vuckovic Vladan, Vidanovic Djordje |
| Keywords: | computational analysis |
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.