Please enable JavaScript.
Coggle requires JavaScript to display documents.
Adversarial search - Coggle Diagram
Adversarial search
-
Solving games
-
-
-
-
Efficiency
Pruning the Tree
Types
Alpha-Beta Pruning
-
Stochastic games - Stochastic games involve uncertainty or randomness in the outcome of actions taken by players. Ex: Backgammon
-
-
-
-
Game Theory
"The study mathematical models of conflict and cooperation between intelligent rational decision-makers".
-
Zero-sum games
Examples: Tictacoe, chees, checkers, othello, go
-
-
-
-
-
-
AND - OR search trees
-
And - Environment could be clean or dirty Therefore Both possibilities have to be accounted for solution is a tree where.
-
Minimax algorithm
The minimax algorithm is a decision-making tool in AI that evaluates all possible moves in a game, assuming optimal play by both players, to minimize the possible loss for a worst-case scenario and maximize the potential gain.