DISSERTATION

Deep Dive on Checkers Endgame Data

Abstract

In this thesis, we investigate applying deep learning techniques to learn the win-loss-draw results contained in the databases of the checkers-playing program CHINOOK. Our initial objectives were to (1) compare a deep-learning-based compression scheme versus the custom algorithm used in CHINOOK, and to (2) extract human-understandable features from the data. We have implemented the data processing pipeline, the neural network and its training loop, and an experimentation infrastructure. Our experiment results suggest that (1) training the neural network with a small random subset of the target database can achieve a high accuracy; (2) using the learned network with a naïve one-ply minimax search can further improve the robustness of the predictor most of the time; (3) transfer learning from one database to another one is feasible; (4) dynamically switching between the model and the one-ply search can give a better result than using either exclusively. We conclude that the neural network equipped with search does a decent job compressing the endgame databases, but the custom algorithm is hard to beat. Extracting features that are useful not only to the neural network but also to humans is a tricky task that requires more sophisticated and creative techniques. Our work is the first effort in this direction.

Keywords:
Chess endgame Artificial neural network Robustness (evolution) Task (project management) Training set Transfer of learning Deep learning

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
0
Refs
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Artificial Intelligence in Games
Physical Sciences →  Computer Science →  Artificial Intelligence
Digital Games and Media
Social Sciences →  Social Sciences →  Sociology and Political Science
Human Motion and Animation
Physical Sciences →  Engineering →  Control and Systems Engineering
© 2026 ScienceGate Book Chapters — All rights reserved.