Early Pruning: The ALPHA-BETA Procedure
The previous algorithm (implicitly)
- generate the tree
- evaluate the leaves
- backup to generate the optimal first action
Interleaving evaluation with generation means that some paths
Cache partial evaluation information at each node
- A MAX node has an ? value which is the best (greatest) choice so far. It can never decrease.
- A MIN node has a b value which is the best (least) choice so far. It can never increase.