Author: Dan Andersson
Date: 05:30:11 11/16/01
Go up one level in this thread
You would not want to use computationally expensive heuristics to solve these cases. One try could be based on the fact that a close to winning score/bound is found in a late endgame at a shallow search. And then deepen the search for the best move by one ply if there are repeated checks or threats. And then repeat that procedure for some plies and if the evaluation is not dropping steadily, then trigger the heuristics. MvH Dan Andersson
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.