PSet 8: Alpha-Beta Pruning
(videos: 2-Player Games and Alpha-Beta Pruning)
Perform α-β pruning on the following tree. Show the values next to the nodes as I did in the video.

Challenge Problem¶
Show that for every game tree, if Min is playing sub-optimally, the utility value for max can never be lower than the value obtained playing an optimal min.