Adaptive Parallel Monte Carlo Tree Search for Efficient Test-time Compute Scaling

Implement 'negative early exit' for MCTS search in local reasoning pipelines. This allows agents to stop dead-end search paths early, saving massive compute.

Suggested repo: PruneSearch

"Cut your agent's compute bill with negative early exit MCTS."

Estimated effort: 25h