An agentic framework enhanced with an experience memory designed for the sequential setting and addressing common challenges of sequential decision-making such as credit assignment is introduced, and it is shown that post-game reflection and rule extraction yield measurable improvements on tic-tac-toe without modifying the model weights.
Abstract
Large language models have improved substantially on single-shot reasoning tasks, but their performance in sequential decision-making is less well understood. We study this on fully-observable two-player zero-sum games, which provide ground-truth evaluation: outcomes are determined by the rules, and optimality of individual moves can be computed or approximated, without relying on a judge model. Across model tiers, LLMs play suboptimally in simple games such as tic-tac-toe or Connect Four, and lose to MCTS opponents. Obfuscations that preserve the game tree but rewrite its surface form leave performance largely unchanged, indicating the gap is not fully explained by recall of memorized strategies. Motivated by this performance gap, we introduce an agentic framework enhanced with an experience memory designed for the sequential setting and addressing common challenges of sequential decision-making such as credit assignment. We show that post-game reflection and rule extraction yield measurable improvements on tic-tac-toe without modifying the model weights.
This work identifies narrow-support imitation as a source of policy collapse in LLM decision-making and suggests that preserving action support during SFT is important for maintaining exploratory behavior.
Junyi Sha, Renfei Tan, David Simchi-Levi· arXiv.org· 0 citations
CAST (Credit Assignment from Solver Teachers), which converts value changes in a game solver's state value into solver advantages and injects them into RLVR as turn-level signals and achieves the highest average zero-shot performance on ALFWorld and WebShop.
Yu Wang, Yi-Kai Zhang, Wentao Shi et al.· arXiv.org· 0 citations
This work formalises a necessary level-K distinguishability condition for strategic depth inference and builds a suite of novel game structures that meet this standard, and finds that model models maintain accurate strategic depth under recursive reasoning, with strong internal consistency between stated reasoning and...
Large-language-model (LLM) agents perform well in embodied benchmarks but are costly, stochastic, and difficult to audit. We propose an LLM-free zero-shot decision agent for ALFWorld that combines structured commonsense priors with adaptive calibration. The agent uses object-location priors, task templates, synonym map...
Shengjie Ma, Jin-Han Li, Guo-An Zhang et al.· 2026 3rd World Conference on...· 0 citations
Large language models (LLMs) have demonstrated strong performance on structured reasoning tasks, but what they encode and whether it informs model behavior remain unclear. We investigate this question through geometric reasoning, using parametric CAD constraints as a controlled testbed for separating local pairwise rel...
M. Liang, Xin-Zhao Cheng, Faizan Wajid· 0 citations
The nature of test-time exploration in RLVR-trained LLMs is investigated by employing controlled maze-solving experiments and extracting a tree structure from mathematical reasoning traces (BODHI-Trees) based on semantic equivalence to delineate between entropy arising from stylistic variations and genuine inferential...
Soumadeep Saha, Krish Sharma, Akshay Chaturvedi et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.