Please enable JavaScript.
Coggle requires JavaScript to display documents.
Adversarial Search - Coggle Diagram
Adversarial Search
-
-
-
Game Theory
-
-
AI focuses on two-player, turn-taking, deterministic games
Zero-Sum Games
Examples: Tic-Tac-Toe, Chess, Checkers, Othello, Go
-
-
-
Minimax Algorithm
Two players: MAX (maximize score), MIN (minimize opponent’s score)
Formal model includes: Initial state, player function, actions, results, terminal test, utility function
-
Stochastic Games
Games with chance elements (e.g., Backgammon)
-
Techniques: Expectiminimax, Monte Carlo Roll-out
-