arXiv AI By Ori Press, Alexander Golubev

Explaining Chess and Go in Natural Language

Read the original on arXiv AI →

The paper introduces an automatic metric for evaluating chess explanations based on chess-engine evaluations and finds that current language models perform poorly, relying on surface-level observations. It presents BinProp, a training-free method that helps models discover reusable chess concepts, significantly improving explainability across multiple models. BinProp also generalizes to other board games such as Go, draughts, and shogi without extra tuning.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Oct 7

Towards the Automatic Synthesis of Interpretable Chess Tactics

The paper presents a symbolic sub‑policy model for chess that incorporates domain knowledge to improve interpretability. By adapting patterns learned through inductive logic programming (PAL), the authors evaluate the model using a divergence metric against a random baseline and show that it can suggest moves comparable to a human beginner. They also propose a computational evaluation scheme that augments an existing engine with their model.

By Abhijeet Krishnan, Chris Martens
arXiv AI
Aug 6

Hallucinations on the Board: Tool-Augmented Evaluation of LLM Chess Commentary

arXiv:2608. 04240v1 Announce Type: cross Abstract: Superhuman game engines in domains like chess have made expert-level evaluations easily accessible, yet they communicate what is true without the natural-language explanations that make such expertise educationally useful to experts and non-experts alike.

By S. Ashwin Hebbar, Peiyao Sheng, Sewoong Oh, Pramod Viswanath
arXiv AI
Oct 7

Learning Explainable Representations of Complex Game-playing Strategies

The paper proposes a method that mimics human cognition to train reinforcement learning agents to generate explainable strategies and policies as executable procedures derived from sequences of gameplay actions. It demonstrates automatic learning of such programs for chess and a grid‑based environment, showing that the resulting strategies produce effective actions and can be learned from gameplay data.

By Abhijeet Krishnan, Colin M. Potts, Arnav Jhala, Harshad Khadilkar, Shirish Karande, Chris Martens