The given question is "In the following two-ply game tree, the terminal nodes show the utility values computed by the utility function. Use the Minimax algorithm to compute the utility values for other nodes in the given game tree."
Now, in minimax algorithm in the MIN nodes, we select a value from the children which is minimum. So, the value in B will be 2, C will be -1 and D will be -3. Now, in MAX node, which is A, we will select the maximum value from the direct children of the node. Hence, the value of A will be 2.
