Please enable JavaScript.
Coggle requires JavaScript to display documents.
Adversarial Search, Efficiency Gains with Alpha-Beta Pruning - Coggle…
Adversarial Search
Game Theory in Adversarial Search
Zero-sum Games
Nash Equilibrium
Minimax and Maximin Strategies
Solving Games with Incomplete Information
Imperfect Information Games
Partially Observable Games
Strategies for Incomplete Information Games
The Minimax Algorithm
Game Tree Search
Depth-Limited Search and Heuristics
Adversarial Search in Multiplayer Games
Multiplayer Games and Strategies
Multi-agent Systems and Negotiation
Prisoner's Dilemma and Cooperation in Adversarial Search
Prisoner's Dilemma and Rational Decision-Making
Cooperation vs. Defection
Alpha-Beta Pruning
How Alpha-Beta Pruning Works
Adversarial Environments
Efficiency Gains with Alpha-Beta Pruning