Please enable JavaScript.
Coggle requires JavaScript to display documents.
Adversarial Search - Coggle Diagram
Adversarial Search
-
Game Theory
-
Zero-Sum Games
Examples: Tic-tac-toe, Chess
-
-
Minimax Algorithm
Used in two-player, zero-sum games
-
-
-
Types of games
Non-Deterministic Games: In these games, chance plays a role in determining the outcome, introducing an element of unpredictability. Card games like poker, where the draw of the cards affects the game, are non-deterministic2
Games with Perfect Information: All players have complete knowledge of the game state and the actions taken by other players up to that point. There are no hidden elements. Chess is also an example of a game with perfect information because all pieces are visible to both players at all times
Deterministic Games: These are games where the outcome is directly determined by the players’ actions without any random elements. Chess is an example of a deterministic game because the outcome is solely based on the players’ decisions
Games with Imperfect Information: Not all aspects of the game state are fully visible to all players. Players may have to make decisions without knowing all the actions previously taken by other players. Poker is a game of imperfect information because players cannot see each other’s hands
Alpha-Beta Pruning
-
-
-
-
-
-
Application
Used in two-player, zero-sum games with perfect information.