Tree of Thoughts: Keeping the Best Thoughts

Intermediate

The problem, from first principles

Tree of Thoughts (Yao et al., 2023) explores reasoning as a search. At each depth it generates several candidate thoughts, scores them with the model, and keeps only the best few. Keeping the top b states is that beam step.

From theory to code

Implement select_top_b(states, scores, b), returning the b best states in order.

Constraints

Higher scores are better.

Hints

Hint 1

Sort the indices by score descending, then take the first b states.

Keywords

research-papersagentssearchreasoning

Python

Run your code to see results

No results yet

Run your code to check it against the examples, or submit to run every test.