Algorithms in a Nutshell

(^208) | Chapter 7: Path Finding in AI
Input/Output
Input
The algorithm starts from an initial position in a game tree and assumes that it
can (a) iterate through all valid moves for a given player at a game state, and (b)
evaluate the game state to compute an integer representing the strength of the
game from a player’s perspective. Smaller integer numbers reflect weaker posi-
tions. The algorithm looks ahead a fixed number of moves, called theply depth.
Output
Return a move from among the valid moves that leads to the best future game
state for a specific player, as determined by the evaluation function.
Figure 7-15. Minimax fact sheet
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