- Now Suppose That The Max Player In The Third Layer Is Replaced By A Chance Player We Then Have The Following Game Tree 1 (33.65 KiB) Viewed 17 times
Max Min Max Min 12 ³XX 8 15 13 11 17 16 7 20 9 14 4 30
Now suppose that the Max player in the third layer is replaced by a Chance player. We then have the following game tree.
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Now suppose that the Max player in the third layer is replaced by a Chance player. We then have the following game tree.
Now suppose that the Max player in the third layer is replaced by a Chance player. We then have the following game tree. Let us say that the chance nodes go their different children with the same probability. Give the value of the root node (L1-1) and the values of the two nodes at the second layer (L2-1 and L2-2). Justify you [2 marks] answer.
Max Min Max Min 12 ³XX 8 15 13 11 17 16 7 20 9 14 4 30
Max Min Max Min 12 ³XX 8 15 13 11 17 16 7 20 9 14 4 30