Sign inGet started
Paper · arXiv

Towards the Automatic Synthesis of Interpretable Chess Tactics

State-of-the-art reinforcement learning agents are capable of outperforming human experts at games like chess, Go and StarCraft II. These agents do not simply take advantage of their digital hardware in being able to react and calculate faster than humans, but employ better strategies that lead to more victories. Interpreting these strategies would give human players valuable insight into how to improve their play. In this preliminary work, we propose a symbolic sub-policy model for playing chess. Inspired by chess tactics, our model attempts to incorporate domain knowledge to improve interpretability. We adapt patterns learned by an inductive logic programming system called PAL to derive...

AuthorsAbhijeet Krishnan, Chris Martens
Primary categorycs.AI
Published6 October 2026
Last updated at source6 October 2026
cs.AIcs.LGcs.SC
Embed this entry
<iframe src="https://silytics.si/embed/item/f132106f-987c-41f1-b76e-584b1bc0ceb6" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.