When a decision unfolds over several steps, choosing the best immediate action may miss better futures. Monte Carlo tree search (MCTS) addresses this by simulating many, but not all, possible futures and using their outcomes to guide the next action. section 12.10 section 12.11
MCTS works as a strategic approximation rather than an exhaustive calculation:
- Represent possible actions and their consequences as branches in a search tree. section 12.10
- Select several promising branches instead of examining every possible future. section 12.10
- Simulate future outcomes, then propagate terminal utilities back toward the initial decision nodes. section 12.10
- Allocate more effort to promising actions, balancing useful exploration with the cost of an intractable full calculation. section 12.10 section 12.11
Game-playing engines
MCTS is used in sophisticated decision-making engines for board games, including high-performing systems such as AlphaZero for chess and AlphaGo for Go. section 12.10

