Language Models that Play Chess and Explain Their Moves

Adithya Bhaskar, Jeffrey Cheng, Danqi Chen

Princeton University

Published October 2, 2026 · on the feed October 5, 2026 · ▲ 37 · arXiv 2610.03695

The abstract

Modern chess engines are silent experts: they play at a superhuman level, but do not offer explanations for their play. On the other hand, language models (LMs) can generate plausible-sounding explanations, but their weak playing strength limits the utility of their explanations. We introduce Queen, a 4B-parameter chess-language model that can explain its moves and plans while playing at the level of a typical Grandmaster. Our novel framework enables domain-specific reasoning through complementary components: an encoder-decoder architecture and an iterative distillation algorithm. This architecture integrates a silent expert chess encoder with an instruction-tuned LM through cross-attention, which we train via a question-answering curriculum to extract chess concepts from the encoder's representations. Building on this domain-adapted model, we iteratively improve its explanations with a natural-language analog of the Bellman update: the model analyzes the positions after its top candidate moves and consolidates them into an explanation of the current position, which is then distilled back into the model. Over seven iterations, our model gains over 900 Elo points (1782 to 2697), substantially surpassing all frontier models on both playing strength and puzzle accuracy, despite containing three orders of magnitude fewer parameters. Furthermore, LM-based evaluations show that our explanations are fluent and approach GPT-5.6-Sol (high) in coherence. The generality of our architecture and training procedure suggests a recipe for applying language models to domains where silent expert encoders are available, like games, robotics, and computer use.

The Brief

2:43

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Language Models that Play Chess and Explain Their Moves. By Adithya Bhaskar and two others, from Princeton University. Published on the second of October. Its code repository is worked out: about one hundred and thirty source files, with a readme and a licence.

Modern chess engines are silent experts. They play at a superhuman level and offer no explanation for any of it. Language models sit at the other end: they can produce explanations that sound plausible, but they play weakly, and an explanation from a weak player is of limited use. One side has the strength, the other has the words, and neither has both. What the authors want is a single model in which the two come together: one that plays well enough for its reasoning to matter, and speaks well enough for that reasoning to be heard.

Queen is a chess-language model of four billion parameters that explains its moves and plans while playing at the level of a typical Grandmaster. The framework behind it has two complementary parts: an encoder-decoder architecture that gives the language model access to chess expertise, and an iterative distillation algorithm that improves what it says.

The architecture connects a silent expert chess encoder to an instruction-tuned language model through cross-attention. It is trained with a question-answering curriculum to extract chess concepts from the encoder's representations, so the language model learns to read what the encoder knows. The encoder stays the expert. The language model becomes its interpreter, and the curriculum of questions and answers is how the two learn a shared vocabulary of chess concepts. This is the domain-adapted model that the next step starts from.

The explanations are then improved by a natural-language analogue of the Bellman update. The model analyses the positions that follow its top candidate moves, consolidates those analyses into an explanation of the current position, and that explanation is distilled back into the model. Each round, the explanation of a position is built from looking one move ahead. The analogy to the Bellman update is that the value of where you are is assembled from the value of where you could go next. Here the quantity being passed backwards is not a number but an explanation in plain language.

Over seven iterations, the model gains more than nine hundred Elo points, rising from one thousand seven hundred and eighty-two to two thousand six hundred and ninety-seven. It substantially surpasses all frontier models on both playing strength and puzzle accuracy, despite having three orders of magnitude fewer parameters. Evaluations by language models find its explanations fluent, and approaching GPT five point six Sol, at its high setting, in coherence.

The authors present this as a recipe rather than a chess result alone. Wherever a silent expert encoder already exists, and they name games, robotics and computer use, the same pairing of encoder and language model, followed by look-ahead distillation, could give that expert a voice.

More with an account

Listen to every day’s papers

Daily playlists, deep dives, quests for the papers, and quizzes on their key terms.

Join free
KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.