| Next |
2.1 Game playing is search problem |
Prev |
Game playing is search problem
Classical game rules are usually perfectly formalized. The optimal
game play is a search of the best next state in the game space, defined by:
- Initial state (board)
- Expand function (build all successor states)
- Cost function (payoff of the state)
- Goal test (ultimate state with maximal payoff)
Game playing is characterized by:
- "Unpredictable" opponent. Should be able to react to all possible
opponent moves.
- Time limits. Games become boring if there is no action for too long.
Opponents are unlikely to find goal, must approximate.