Monte Carlo Tree Search

UCT Selection · Expansion · Simulation · Backpropagation

Iterations: 0
Root visits: 0
Best child win%: —
Ready
UCT formula: UCB1 = W/N + c√(ln N_parent / N). Nodes: visits / wins. Node size ∝ visits. Color: win rate (green=high).