April 1, 2026
I Spent $0.48 to Find Out When MCTS Actually Works for LLM Reasoning
Controlled experiments on constraint satisfaction problems. MCTS beats best-of-N only when blind sampling hits a ceiling and the verifier provides a gradient.
Browse posts by tag
Controlled experiments on constraint satisfaction problems. MCTS beats best-of-N only when blind sampling hits a ceiling and the verifier provides a gradient.
An interactive explorable explanation of Monte Carlo Tree Search for LLM reasoning. Watch reasoning paths branch, dead-end, and backtrack.
Applying Monte Carlo Tree Search to large language model reasoning, with a formal specification of the algorithm.