Author: Rémi Coulom
Date: 06:30:12 06/23/00
In The Crazy Bishop, I mark all positions from the game history (=past positions in the game) which are in the hash table as unreliable (ie, do not use the eval, but the best move is still useful) before starting a new search. Removing them completely from the hash table would work too. This should solve your problem, if I understood it well. I also always test for 3-fold repetition before probing the hash table during the search. I think that the combination of these two things makes the search very safe in respect of hash-table-related 3-fold repetition problems. Remi (I got a "Document contains no data" error when trying to reply to the original message).
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.