aiqbench analysis
This research addresses the "black box" problem in game-playing AI by introducing BinProp, a training-free method that helps language models extract transferable strategic concepts from chess and Go rather than relying on superficial board observations. The study demonstrates that this approach significantly improves explainability across multiple complex games without requiring additional model tuning or retraining.
Explaining Chess and Go in Natural Language
arXiv:2610.23166v1 Announce Type: cross Abstract: Modern chess engines play far beyond human ability, often choosing moves whose underlying ideas are difficult for humans to understand. We propose an automatic metric for evaluating chess explanations, grounded in chess-engine evaluations. Evaluating state-of-the-art language models using this metric, we find that they perform surprisingly poorly, often relying on surface-level board observations rather than robust, transferable chess concepts. We then introduce BinProp, a training-free method that enables these same models to discover reusable chess concepts and use them to explain moves in natural language. BinProp improves explainability for every model tested, nearly tripling the average score compared with direct prompting. Beyond chess, the same method discovers useful concepts in Go, draughts, and shogi without additional tuning.
Abstract:Modern chess engines play far beyond human ability, often choosing moves whose underlying ideas are difficult for humans to understand. We propose an automatic metric for evaluating chess explanations, grounded in chess-engine evaluations. Evaluating state-of-the-art language models using this metric, we find that they perform surprisingly poorly, often relying on surface-level board observations rather than robust, transferable chess concepts. We then introduce BinProp, a training-free method that enables these same models to discover reusable chess concepts and use them to explain moves in natural language. BinProp improves explainability for every model tested, nearly tripling the average score compared with direct prompting. Beyond chess, the same method discovers useful concepts in Go, draughts, and shogi without additional tuning.
Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
arXiv:2610.23166 [cs.CL]
(or arXiv:2610.23166v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2610.23166 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 218 words
Related coverage

AI Futures: Racing to Lose, A sermon
LessWrong · Sep 28, 2026

What can language models teach us about understanding?
LessWrong · Oct 9, 2026

What We're Up Against: An AI Safety Crash Course
LessWrong · Sep 24, 2026
Language Models that Play Chess and Explain Their Moves
arXiv · Oct 5, 2026