Monte Carlo Tree Search — how it works in AlphaGo/MuZero.
hard- Iteratively build a tree of possible action sequences.
- Each iteration: (1) Select — walk from root using UCB1 (or PUCT) balancing exploration + Q.
- (2) Expand — add new child node.
- (3) Evaluate — value estimate from neural net (AlphaZero) or rollout.
- (4) Backup — propagate value up.
- After N iterations, pick move with highest visit count.
- UCB: a = argmax Q + c √.
- Foundation of AlphaGo, AlphaZero, MuZero.