Dubbed Adaptive Branching Monte Carlo Tree Search (AB-MCTS), it is a new inference-time scaling algorithm by Sakana AI.

Researchers found a clear way to show that for some puzzle-like problems there is no shortcut and you must check every possibility, helping set ...