Papers
arxiv:2607.25308

CAST: Game Solvers as Turn-Level Teachers for LLM Agents

Published on Jul 28
· Submitted by
Yu Wang
on Jul 30
#3 Paper of the day
Authors:
,
,
,
,
,
,
,
,
,

Abstract

Training large language models (LLMs) to act in long-horizon games is a promising step toward generalist decision-making, yet reinforcement learning with verifiable rewards (RLVR) relies on sparse final rewards that reveal little about which decisions determine success. Denser process signals could supply this missing turn-level credit, but existing sources are hard to keep both cheap and accurate. We observe that changes in a game solver's state value reveal whether an action advances the state toward success. Building on this insight, we propose CAST (Credit Assignment from Solver Teachers), which converts these value changes into solver advantages and injects them into RLVR as turn-level signals. We further show that, under a soft-optimal solver assumption, maximizing the solver advantage is equivalent to on-policy distillation from the solver, requiring only scalar values rather than teacher logits. Across Sokoban, Minesweeper, and Rush Hour, CAST outperforms all trained baselines on every game under both in-domain and unseen-difficulty evaluation and achieves the highest average zero-shot performance on ALFWorld and WebShop. Our code is available at https://github.com/Wloner0809/CAST.

Community

Paper author Paper submitter

Training LLMs to play long-horizon games with RLVR is hard: the reward is a single 0/1 signal at the very end, so the model never learns which move actually won or lost the game. This is the classic credit-assignment problem.

CAST fixes this by recruiting a game solver as a turn-level teacher 👨‍🏫. By evaluating the states visited by the agent, the solver estimates how much work remains before a win—or detects that a state is unsolvable. CAST turns the one-step change in this cost-to-go into a per-action solver advantage and injects it into RLVR, giving the model dense, turn-level feedback at negligible estimated overhead.

💡 The kicker: under a soft-optimal solver assumption, the raw solver advantage is proportional to the solver's log-probability for the sampled action. It therefore yields a form of on-policy, logit-free distillation that needs only one scalar per action, rather than the teacher's full action distribution. The shaped training objective and its reverse-KL interpretation are derived under the additional assumptions stated in the paper.

Sign up or log in to comment

Get this paper in your agent:

hf papers read 2607.25308
Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/2607.25308 in a model README.md to link it from this page.

Datasets citing this paper 0

No dataset linking this paper

Cite arxiv.org/abs/2607.25308 in a dataset README.md to link it from this page.

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/2607.25308 in a Space README.md to link it from this page.

Collections including this paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.