Papers · Tree of Thoughts
AI PAPER

Tree of Thoughts: Deliberate Problem Solving with Large Language Models

Extended chain-of-thought into a tree search over reasoning paths, allowing language models to explore, evaluate, and backtrack through multiple solution strategies.

Authors
Shunyu Yao, Dian Yu, Jeffrey Zhao +4
Institution
Princeton University
Published
May NaN, 2023
Citations
2,500
Category
Reasoning
Impact
major
PAPER EXPLAINED

Plain-English Summary

Chain-of-thought prompting lets models think step by step, but it commits to a single reasoning path. If the model makes a wrong turn early on, it cannot recover. Tree of Thoughts (ToT) fixes this by allowing the model to explore multiple reasoning paths simultaneously, evaluate which paths are most promising, and backtrack from dead ends — much like how humans approach complex puzzles.

The model generates multiple possible next steps at each point, evaluates their promise (either by the model itself or by a separate evaluation), and uses search algorithms (breadth-first or depth-first) to explore the tree of possibilities. On tasks requiring strategic planning — like Game of 24 or creative writing — ToT dramatically outperforms standard prompting.

Key Innovation

ToT formalized the connection between language model reasoning and classical AI search. By framing each reasoning step as a node in a tree and applying systematic search algorithms, the approach recovers capabilities that had been central to AI (planning, backtracking, lookahead) but lost in the autoregressive generation paradigm.

The self-evaluation mechanism allows the model to assess its own partial solutions without external feedback, combining generation and evaluation within a single model. This enables deliberate, strategic reasoning rather than purely forward-flowing generation.

Impact on the Field

Tree of Thoughts influenced the development of reasoning-focused models. OpenAI’s o1 model implements a trained version of deliberate reasoning with search and evaluation. The paper demonstrated that language models have latent reasoning capabilities that can be unlocked through appropriate inference-time computation — spending more time thinking rather than just making the model larger.

This insight — that inference-time compute scaling can substitute for training-time scaling — has become one of the most important ideas in the field.

Models That Built on This

OpenAI’s o1 and o3 models implement trained versions of tree-search reasoning. Claude’s extended thinking mode draws on similar principles of deliberate reasoning with evaluation. Google’s Gemini reasoning capabilities incorporate search-over-thoughts approaches. The broader field of “inference-time scaling” that has emerged in 2024-2025 traces its conceptual roots partly to this work.