Tree of Thoughts (Yao et al. 2023) explores multiple reasoning branches at each step. On what kind of problem does the tree structure pay off over a single-thread Chain of Thought?

**Tree of Thoughts** (often shortened to ToT) is a prompting pattern where the model explores several possible next reasoning steps from each state, evaluates them, prunes the bad ones, and continues searching down the promising branches. The result is a tree of partial reasoning paths rather than a single linear chain. The payoff comes from being able to detect a wrong path before reaching the final answer. If you can tell partway through that a branch is going nowhere, you save the rest of the work on that branch and put compute into branches that look better. Classic ToT examples are Game of 24, crossword puzzles, and small-scale planning problems, where partial states are easy to score. For problems where every path looks equally good until the very end, ToT does not help. The pruning step has nothing to act on, so you just paid 5 to 50 times more compute to end up at the same answer as a single CoT chain. The pattern is targeted, not universal.

ToT pays off when the problem has two specific properties at once. First, multiple plausible reasoning paths exist from each intermediate state, so there is something to branch over. Second, partial paths can be evaluated before reaching the final answer, so there is a signal to prune on. This is the classic profile of a search problem. Game of 24, crosswords, small-scale planning, and constraint-satisfaction tasks all fit. The model proposes K candidate next steps from each state, a value function (often another prompt) scores each partial path, and the search keeps the top-B branches and continues. The structure is a beam search over reasoning. Compare with Chain of Thought, which is one linear chain. CoT is more efficient when the problem is well-conditioned and a competent first attempt usually succeeds. Compare with self-consistency, which samples N parallel chains and votes on their final answers. Self-consistency assumes parallel independence; ToT assumes intermediate evaluability. The production caveat is cost. ToT typically runs at 5 to 50 times the base inference cost depending on branching factor K and tree depth D. That is fine for high-value puzzle-style tasks. It is wasteful for tasks where partial reasoning cannot be scored or where a single CoT chain solves the problem most of the time.