Problem Set 4
Assigned: Feb. 18
Due: Feb. 25
Show how the game tree below is evaluated using alpha-beta pruning. You may
mark your answer on this sheet, and hand it in in hardcopy. Specifically:
- Cross out links to subtrees that are not evaluated.
- Mark every interior node that is evaluated with the exact value or
upper or lower bound that is computed.
- Mark the best move for MAX at the top level.
An example of the form of the answer is below.