Artificial Intelligence ( Game Playing )
- 2. ARTIFICIAL INTELLIGENCE GAME PLAYING BY AQSA HAYAT ARTIFICIAL INTELLIGENCE
- 3. GAME PLAYING Game A game consists of a set of two or more players, a set of moves for the players, and a specification of payoffs (outcomes) for each combination of strategies.
- 4. MANY DIFFERENT TYPES OF GAMES • two-person zero-sum • multi-player • perfect information games • imperfect information game • games of chance
- 5. GAMES VS. SEARCH PROBLEMS Game playing is a search problem Defined by – Initial state – Successor function – Goal test – Path cost / utility / payoff function
- 6. CHARACTERISTICS OF GAME PLAYING • “Unpredictable” opponent: Solution is a strategy specifying a move for every possible opponent reply • Time limits: Unlikely to find goal, must approximate
- 7. GAME TREES A strategy defines a complete plan of action for a given player. Given enough processing time an optimal strategy can be found for games of perfect information by enumerating paths of a game tree. However, in practice this can only be done for small games.
- 8. GAME TREE: 2-PLAYER / DETERMINISTIC / TURNS
- 9. MULTI-PLAYER GAMES When we have more than two players we need to adapt the minimax approach. The most conservative strategy is to assume that all of your opponents are conspiring to minimize your score. Treat your opponents as one big powerful player.
- 10. BIG GAMES (E.G., PATCHWORK)
- 11. BIG GAMES (E.G., PATCHWORK)