Please enable JavaScript.
Coggle requires JavaScript to display documents.
Adversarial Search - Coggle Diagram
Adversarial Search
Strategy
In the fully observable and deterministic environment, the agent knows the effects of actions and can calculate the next state. BUT If the environment is partially observable or non-deterministic, Future percepts are not known in advance, so no sequence but instead a CONTINGENCY PLAN.
AND-OR Search Trees
Solution is a tree where Goal node at every leaf
1 action specified at each OR
Includes every outcome at each AND
Adversarial search is a type of search in which we look at the problem that develops when we try to plan ahead of the world while other agents plan against us
Game Theory
Game Theory is the study of mathematical models of conflict and cooperation between intelligent, rational decision-makers
Minimax Algorithm
Minimax is a kind of backtracking algorithm that is used in decision making and game theory to find the optimal move for a player, assuming that your opponent also plays optimally. It is widely used in two player turn-based games.
Games
-
Tic-Tac-Toe Game Tree - Nodes are states, edges are moves
-
-