Extracting Search Trees from LLM Reasoning Traces Reveals Myopic Planning
Sixing Chen, Ji-An Li, Saner Cakir, Sinan Akcali, Kayla Lee, Marcelo G. Mattar

TL;DR
This paper introduces a method to analyze LLM reasoning traces by extracting search trees, revealing that LLMs rely on shallow search and myopic planning, contrasting with human deep planning.
Contribution
The work presents a novel framework for characterizing LLM planning through search tree extraction and demonstrates key differences from human planning behaviors.
Findings
LLMs' search is shallower than humans'
Performance correlates with search breadth, not depth
Move choices are driven by shallow nodes, not deep lookahead
Abstract
Large language models (LLMs), especially reasoning models, generate extended chain-of-thought (CoT) reasoning that often contains explicit deliberation over future outcomes. Yet whether this deliberation constitutes genuine planning, how it is structured, and what aspects of it drive performance remain poorly understood. In this work, we introduce a new method to characterize LLM planning by extracting and quantifying search trees from reasoning traces in the four-in-a-row board game. By fitting computational models on the extracted search trees, we characterize how plans are structured and how they influence move decisions. We find that LLMs' search is shallower than humans', and that performance is predicted by search breadth rather than depth. Most strikingly, although LLMs expand deep nodes in their traces, their move choices are best explained by a myopic model that ignores those…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
