•Let a,b be local
lower,upper bound guarantees
–"If play proceeds
here, root will score at least a."
–"If play proceeds
here, root will score at most b."
•Pruning thus according
to a and b is called alpha-beta
pruning.
•Minimax search with
alpha-beta pruning is sometimes called alpha-beta search.
