Reasoning & Test-Time Compute · 2023

Structured Reasoning: Least-to-Most / PoT / Tree of Thoughts

Denny Zhou, Quoc V. Le, Ed H. Chi, Wenhu Chen, William W. Cohen, Shunyu Yao, Karthik Narasimhan

This family reorganized chain-of-thought into explicit search or decomposition structures, letting a model explore, evaluate, and backtrack over intermediate steps instead of committing to one linear reasoning path.

Editorial record

Plain-language summary

Tree of Thoughts generalizes chain-of-thought by having the model generate multiple candidate reasoning steps, score them with a value estimate, and search the resulting tree with breadth- or depth-first exploration and backtracking. Least-to-Most decomposes a hard problem into ordered easier subproblems solved in sequence, and Program-of-Thought offloads arithmetic and logic to generated code executed by an interpreter. The shared move is treating reasoning as a structured, evaluable process rather than a single sampled string, which raised accuracy on tasks requiring planning, search, or exact computation.

Knowledge graph

Relationships

Descendants

Source record

Provenance

Record ID
P-222
Record created
2026-07-13
Last reviewed
2026-07-14
Record version
2

Citation caveat: Citation metadata is approximate and marked unverified in the source dataset.