IN THIS BREAKDOWN · 10 SECTIONS
You can read 17% of this breakdown.
The paper in one minute
This paper evaluates reasoning models on puzzles whose size can be varied while their rules remain stable. Instead of scoring only a final answer, the authors extract candidate plans and execute them in simulators. That reveals illegal transitions, incomplete plans and the point at which an apparently plausible solution stops working.
The tested models show different behavior at different difficulty levels. Extra thinking can help in an intermediate range, while harder instances eventually produce severe accuracy declines. Longer reasoning traces do not reliably prevent those failures, and the authors observe reduced thinking-token use beyond some difficulty thresholds.
The result is evidence about particular models, prompts and puzzle tasks. It is not a proof that all language models lack reasoning, that tool-using agents cannot solve these problems, or that future models must fail at the same threshold. Those are broader claims than this experiment can establish.
This page uses the November 2025 camera-ready revision. Its appendix responds to critiques of the original June paper and narrows some experimental ranges. Reading that revision matters because repeating the initial controversy without the later controls gives an incomplete account of the evidence.
Research notes: the problem, approach and results
controlled puzzle families
samples per instance and complexity level, appendix A.3
minimum Hanoi moves; exact mathematical requirement
Final benchmark scores can hide where long reasoning and exact execution fail.
Vary puzzle difficulty and validate both final plans and extractable intermediate attempts with simulators.
The tested models show task-dependent failure regimes; interpretation requires attention to representation, solvability and the revised experiments.
Why it matters to an FDE
An enterprise agent can explain a sensible procedure and still violate a constraint halfway through execution. A migration plan might name the right steps but perform them in the wrong order. A reconciliation workflow might preserve totals initially and then lose track of one exception.
The paper suggests a useful evaluation habit: inspect state transitions and first failures, not only the final narrative. It also shows why spending more inference tokens is an intervention to test rather than a general reliability guarantee.
Connect agent trajectory evaluation with benchmark limitations. A production test should separate planning, tool execution, output formatting and recovery. The customer needs a correct completed workflow; understanding which component fails is what lets an FDE improve that outcome.
Understand the mechanism. Try it on a real problem.
Unlock this breakdown and 199 more papers.
Premium opens every paper in full, plus every answer, concept, course and guide on the site. One payment for six months of access.
6 months · One payment · No auto-renewal
- ◇1 architecture diagram
- </>2 runnable code blocks
- ▦3 results tables
- 03Key takeaways
Six distinctions for interpreting reasoning failures and designing a useful evaluation
Free account - 04How it works
Follow controlled instance generation, plan extraction and simulator-based failure analysis
Premium - 05The numbers that matter
Use exact task counts and reported setup details without inventing a universal reasoning threshold
Premium - 06Try it yourself
Build a stateful verifier that distinguishes complete, incomplete, illegal and malformed plans
Premium - 07Where it breaks
Read the published critique alongside the revised paper and keep conclusions within the evidence
Premium - 08Using it on a deployment
Apply the paper's diagnostic method to customer workflows with explicit states and invariants
Premium - 09Interview angles
Explain why an evaluation failure needs a diagnosis before it becomes a claim about model capability
Premium - 10Read next
Connect puzzle execution with reasoning traces, inference budgets and tool-assisted agents
Premium
