Game Search

Fill in the internal node values in the following game tree, after traversal by the MiniMax algorithm:

                          _                             MAX
         /                |                \
        _                 _                 _           MIN
   /    |    \       /    |    \       /    |    \
  _     _     _     _     _     _     _     _     _     MAX
 /|\   /|\   /|\   /|\   /|\   /|\   /|\   /|\   /|\
5 4 3 6 4 3 7 4 3 7 8 9 9 8 7 9 2 2 3 8 2 4 4 4 4 3 4

Trace (like we did in class, and shown in the notes) the MiniMax algorithm with Alpha-Beta pruning for the game tree above. Indicate which leaf nodes do not require static evaluation.