Please enable JavaScript.
Coggle requires JavaScript to display documents.
Adversarial Search - Coggle Diagram
Adversarial Search
Minimax
-
-
-
-
-
-
-
Improvements
Resources are limited
Cannot search to leaves
-
game-tree prunning
-
alpha-beta pruning
- we are computing the min-value at
some node n
- we're looping over n children
- n's estimate of the childrens' min is dropping
- Who cares about n's value? MAX
- Let a be the best value that max
can get at any choice point along
the current path from the root
- If n becomes worse than a, MAX will avoid it,
so we can stop considering the other children.
-
-
-
Single-agent trees
-
-
for non-terminal states, the value is the maximum of the children
-