The 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, we can see that for B, C and D, we have to select the maximum value from their child nodes. For B, the maximum value will be 4. For C, it will be 2 and for D it will be 6.
Now, A will select the minimum of B, C and D. The minimum is C having a value of 2. Hence, A will get a value 2.
Summing up, we can tabulate the utility values of the nodes.
A | 2 |
B | 6 |
C | 2 |
D | 4 |