Alpha-beta Pruning
Maintains 2 threshold values: alpha and beta
Alpha: lower bound on the value that a maximizing node may be assigned
Beta: upper bound on the value that a minimizing node may be assigned
Search at a minimizing level can be cut off when a value less than alpha is discovered
Search at a maximizing level can be cut off when a value greater than beta is discovered
Doesn’t change complexity: worst case ordering of node still leads to exponential exhaustive search.