Algorithms in a Nutshell

(^212) | Chapter 7: Path Finding in AI
Because we assume the opponent makes no mistakes,MAXcan stop searching a
MINsubtree once playerMINis able to counter with a move whose resulting
game state evaluates to less than thismaxValue. Similarly,MINtries to minimize
theevaluatedgamestategivena setofpotentialmoves;aseachmoveis evaluated,
Figure 7-17. Sample Minimax exploration
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