Problem 1: Consider the following game tree in which the utility values (in parentheses at the...

 

Transcribed Image Text:

Problem 1: Consider the following game tree in which the utility values (in parentheses at the leaf nodes) are all from the first player's point of view. Assume that the first player is the maximizing player. МАX MIN B D E F MAX LM NO P QRST UV W X Y (2) (3) (8) (5) (7) (6) (0) (1) (5) (2) (8) (4) (10) (2) Figure 1.1 a. What leaf nodes (nodes at the bottom layer) would not need be examined using the alpha-beta pruning algorithm - assuming that the nodes are examined in left-to-right order? Show the derivation procedure on the graph. b. What move should the first player (the root node) choose? c. What's the final minimax value of the root node? %3D Problem 1: Consider the following game tree in which the utility values (in parentheses at the leaf nodes) are all from the first player's point of view. Assume that the first player is the maximizing player. МАX MIN B D E F MAX LM NO P QRST UV W X Y (2) (3) (8) (5) (7) (6) (0) (1) (5) (2) (8) (4) (10) (2) Figure 1.1 a. What leaf nodes (nodes at the bottom layer) would not need be examined using the alpha-beta pruning algorithm - assuming that the nodes are examined in left-to-right order? Show the derivation procedure on the graph. b. What move should the first player (the root node) choose? c. What's the final minimax value of the root node? %3D