Large chess endgame tablebases do not add much to a chess engine's strength because those difficult endgames occur very rarely by chance.
However, what if it is not left to chance? An engine assumes its opponent does not have a tablebase while it does, and assumes the opponent will not be able to play certain difficult, long endgames correctly, swindling a draw despite large material imbalance, or a win despite a theoretical draw. The engine deliberately steers toward, for example, Q vs R or RB vs R.
The game is no longer symmetric, possibly requiring significant changes to search algorithms.
No comments :
Post a Comment