Test-Time Compute & MCTS Reasoning Explorer
An interactive visual laboratory modeling the paradigm shift in frontier AI: replacing greedy single-pass sampling with test-time search trees, Process Reward Model (PRM) step scoring, active thought backtracking, and compute budget optimization.
The Mathematics of Test-Time Compute Scaling
Historically, machine learning performance was governed almost exclusively by pre-training compute scaling laws (parameters and training tokens). Frontier reasoning architectures (OpenAI o1/o3, DeepSeek-R1) unlock a second scaling axis: dynamic test-time compute.
1. Process Reward Models (PRMs)
Unlike Outcome Reward Models (ORMs) that evaluate only the final response, PRMs evaluate step-by-step reasoning tokens, assign probability estimates to individual assertions, and enable instantaneous pruning of hallucinations before downstream tokens are wasted.
2. Upper Confidence Bound (UCT)
Tree exploration balances exploitation of high-value thoughts with exploration of novel solution branches via the polynomial Upper Confidence Bound:
UCT = Q(s,a) + c * P(s,a) * sqrt(N_parent) / (1 + N_child).
3. Backtracking & Self-Correction
When an assertion violates mathematical invariants, the agent halts expansion, marks the node as pruned with negative reward, and backtracks to the closest high-confidence ancestor node to synthesize an alternate trajectory.