Algorithms in a Nutshell

(^220) | Chapter 7: Path Finding in AI
At the initial nodenin the game tree, player O must consider one of six potential
moves. Pruning can occur either on the player’s turn or the opponent’s turn. In
the search shown in Figure 7-22, there are two such examples:
Figure 7-22. AlphaBeta three-ply search
Algorithms in a Nutshell
Algorithms in a Nutshell By Gary Pollice, George T. Heineman, Stanley Selkow ISBN:
9780596516246 Publisher: O'Reilly Media, Inc.
Prepared for Ming Yi, Safari ID: [email protected]
Licensed by Ming Yi
Print Publication Date: 2008/10/21 User number: 594243
© 2009 Safari Books Online, LLC. This PDF is made available for personal use only during the relevant subscription term, subject to the Safari Terms of Service. Any other use