Author: Scott Smedley
Date: 21:28:54 08/08/01
Hi All, I've just implemented a transposition table in my chess program (affectionately known as DaRK KNiGHT) & the first thing I realised is that I have no way of detecting perpetual check, repetitive position draws & the like. So my question is: How can a program recognise/handle the 3rd occurance of a position if it's using a transposition table? The score for a position in the transposition table may or may not be based on draw-by-repetition terminal nodes in its search path. Actually, now that I think about it a litte more, this begs a more quintessential question: How do I avoid using an inaccurate score in a transposition table due to potential draw-by-repetition terminal nodes in the search path? SCoTT! :)
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.