Please enable JavaScript.
Coggle requires JavaScript to display documents.
Adversarial search - Coggle Diagram
Adversarial search
-
The Adversarial search is a well-suited approach in a competitive environment, where two or more agents have conflicting goals.
AND-OR search trees
-
building an AND-OR search tree example for Vacuum cleaner world 
-
-
-
-
-
-
-
Game Theory
Game theory is the study of how and why individuals and entities (called players) make decisions about their situations.
-
Multi-agent environments
AI, convenient models are deterministic, turn-taking and two-player
Zero-sum games
Tictactoe, chess, checkers, othello, go
Perfect information
-
-
-
Max and Min
-
-
-
-
Results (s, a) = transition model
Tictactoe game tree
-
MAX plays X , MIN plays O
Nodes are states, edges are moves
Minimax Algorithm
-
-
-
-
Normal search is a basic algorithm that checks each element in a list sequentially until a match is found or all elements have been checked.
The Adversarial search is a well-suited approach in a competitive environment, where two or more agents have conflicting goals.
Alpha-Beta Pruning
-
-
-
-
Prisoner’s dilemma
-
Stochastic games
A stochastic game is a multi-agent game where players take turns making decisions, influencing the game’s current state and future states.
Ex.Backgammon
Backgammon must include chance nodes that represent the outcomes of random events, like dice rolls.
The expectiminimax algorithm is a generalization of the minimax algorithm used for stochastic games.