Please enable JavaScript.
Coggle requires JavaScript to display documents.
Adversarial search (2 opposite Stages (Win, Lose, Draw), Game Theory…
Adversarial search
-
Game Theory
-
Solving Games
-
Chess search tree, av. 50 moves each, 35 branches per node
= 10 to power 154 nodes!
-
-
-
-
-
-
-
Minimax algorithm
Description
-
-
-
Results (s, a) = transition model
-
-