Chess AI: Competing Paradigms for Machine Intelligence
Not on the map. Why?
Abstract (arXiv)
Endgame studies have long served as a tool for testing human creativity and intelligence. We find that they can serve as a tool for testing machine ability as well. Two of the leading chess engines, Stockfish and Leela Chess Zero (LCZero), employ significantly different methods during play. We use Plaskett's Puzzle, a famous endgame study from the late 1970s, to compare the two engines. Our experiments show that Stockfish outperforms LCZero on the puzzle. We examine the algorithmic differences between the engines and use our observations as a basis for carefully interpreting the test results. Drawing inspiration from how humans solve chess problems, we ask whether machines can possess a form of imagination. On the theoretical side, we describe how Bellman's equation may be applied to optimize the probability of winning. To conclude, we discuss the implications of our work on artificial intelligence (AI) and artificial general intelligence (AGI), suggesting possible avenues for future research.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 13 of its 69 references that are in the map. First posted on arXiv 23 Sep 2021.
Builds on
13 of 69 references.
References · 13
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2017Squeeze-and-Excitation Networkscited by 4,789
- 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,548
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,593
- 2019Mastering Atari, Go, Chess and Shogi by Planning with a Learned Modelcited by 1,353
- 2018A Game-Based Approximate Verification of Deep Neural Networks with Provable Guaranteescited by 33
- 2017Towards "AlphaChem": Chemical Synthesis Planning with Tree Search and Deep Neural Network Policiescited by 5
- 2014A Bellman View of Jesse Livermorecited by 3
Built on by
Citing papers per year: 2022: 2; 2023: 2; 2024: 1; 2025: 1; 2026: 2.
8 papers.
- 2023Adaptive Online Replanning with Diffusion Modelscited by 34
- 2024Designing Skill-Compatible AI: Methodologies and Frameworks in Chesscited by 10
- 2022Learning Chess With Language Models and Transformerscited by 6
- 2022Impartial Games: A Challenge for Reinforcement Learningcited by 3
- 2023The Value of Chess Squarescited by 2
- 2026Mixture of Masters: Sparse Chess Language Models with Player Routingcited by 1
- 2025Liquid Reasoning Transformers: A Sudoku-Based Prototype for Chess-Scale Algorithmic Taskscited by 0
- 2026Abstract Concept Modelling in Conceptual Spaces: A Study on Chess Strategiescited by 0
- 2026Mixture of Masters: Sparse Chess Language Models with Player Routing4 Feb 2026
- 2026Abstract Concept Modelling in Conceptual Spaces: A Study on Chess Strategies29 Jan 2026
- 2025Liquid Reasoning Transformers: A Sudoku-Based Prototype for Chess-Scale Algorithmic Tasks14 Dec 2025
- 2024Designing Skill-Compatible AI: Methodologies and Frameworks in Chess8 May 2024
- 2023Adaptive Online Replanning with Diffusion Models14 Oct 2023
- 2023The Value of Chess Squares8 Jul 2023
- 2022Learning Chess With Language Models and Transformers24 Sep 2022
- 2022Impartial Games: A Challenge for Reinforcement Learning25 May 2022