In Monte Carlo tree search, backpropagation carries a simulation’s outcome from an expanded node toward the root. Updating statistics along the path lets later iterations learn from the rollout. section 7.5
For each node on the path from the expanded node to the root:
- Increment its visit count and add the simulation reward to its total reward. section 7.3 section 7.5
Figure 7.4 The four-phase cycle of Monte Carlo Tree Search.
See how backpropagation fits into the repeating four-phase MCTS cycle. section 7.3
