This course has already ended.

Quiz: Minimax trees - Max rootΒΆ

../_images/example_tree.png

Consider the minimax tree above with the following values: A:-2, B:12, C:9, D:5, E:12, F:7, G:14, H:-1, I:-4, J:-4, K:5, L:-4, M:12, N:-1, O:6, P:6 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:0, B:14, C:1, D:-2, E:11, F:-2, G:9, H:-5, I:6, J:-4, K:-3, L:2, M:8, N:1, O:8, P:10 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:9, B:6, C:10, D:13, E:8, F:14, G:3, H:14, I:6, J:6, K:10, L:12, M:-4, N:3, O:5, P:-1 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:1, B:2, C:2, D:-3, E:7, F:-2, G:9, H:-3, I:10, J:5, K:14, L:10, M:-1, N:3, O:7, P:7 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:7, B:9, C:2, D:2, E:7, F:2, G:13, H:-3, I:8, J:11, K:10, L:9, M:1, N:6, O:5, P:2 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:9, B:-1, C:-1, D:0, E:13, F:-5, G:4, H:6, I:8, J:0, K:1, L:7, M:-1, N:-3, O:-2, P:12 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:5, B:12, C:10, D:11, E:-4, F:-2, G:-1, H:9, I:10, J:4, K:6, L:2, M:8, N:-4, O:-1, P:0 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:-1, B:6, C:11, D:1, E:12, F:2, G:6, H:1, I:1, J:9, K:13, L:8, M:4, N:5, O:9, P:-4 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:12, B:11, C:-2, D:8, E:-3, F:-2, G:-4, H:8, I:3, J:9, K:13, L:9, M:-3, N:-2, O:14, P:11 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:-4, B:3, C:11, D:-5, E:-1, F:5, G:-1, H:11, I:13, J:6, K:-5, L:-2, M:5, N:7, O:7, P:6 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:-1, B:-5, C:4, D:-2, E:3, F:0, G:11, H:4, I:6, J:14, K:1, L:2, M:-3, N:9, O:5, P:3 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:9, B:6, C:14, D:8, E:8, F:3, G:7, H:0, I:7, J:2, K:9, L:14, M:7, N:3, O:11, P:2 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:14, B:-5, C:5, D:11, E:3, F:13, G:11, H:6, I:10, J:1, K:5, L:6, M:0, N:11, O:-3, P:4 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:10, B:13, C:6, D:13, E:7, F:6, G:-3, H:0, I:3, J:-5, K:3, L:14, M:7, N:5, O:-2, P:10 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:12, B:5, C:7, D:13, E:5, F:8, G:0, H:12, I:1, J:4, K:-2, L:4, M:1, N:-2, O:14, P:-4 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:-4, B:13, C:10, D:-1, E:7, F:8, G:-3, H:2, I:4, J:1, K:6, L:14, M:-4, N:-5, O:8, P:-1 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:9, B:1, C:2, D:4, E:10, F:10, G:6, H:-2, I:-4, J:-4, K:3, L:10, M:-2, N:-5, O:-1, P:12 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:9, B:11, C:6, D:6, E:6, F:0, G:3, H:11, I:2, J:0, K:-5, L:9, M:-1, N:13, O:-4, P:9 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:-2, B:5, C:11, D:9, E:-2, F:-3, G:12, H:-4, I:-2, J:11, K:5, L:-2, M:-2, N:6, O:-1, P:9 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:-5, B:9, C:10, D:0, E:13, F:-3, G:-3, H:2, I:10, J:13, K:9, L:5, M:-4, N:9, O:1, P:2 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:1, B:-2, C:8, D:12, E:8, F:1, G:-3, H:2, I:9, J:-5, K:1, L:2, M:-1, N:1, O:7, P:9 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:7, B:2, C:-5, D:-2, E:7, F:14, G:14, H:-5, I:3, J:-1, K:8, L:12, M:1, N:10, O:1, P:14 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:8, B:-1, C:-1, D:4, E:7, F:-4, G:10, H:9, I:0, J:1, K:-1, L:0, M:11, N:-1, O:1, P:-5 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:8, B:1, C:13, D:-2, E:11, F:-5, G:-3, H:14, I:8, J:-4, K:-5, L:7, M:1, N:11, O:-4, P:14 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:-5, B:13, C:-4, D:5, E:-5, F:-1, G:13, H:1, I:10, J:7, K:-5, L:-3, M:11, N:4, O:7, P:1 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:10, B:1, C:4, D:6, E:2, F:8, G:-1, H:4, I:13, J:7, K:13, L:5, M:3, N:3, O:9, P:0 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:5, B:0, C:6, D:-4, E:-2, F:-3, G:0, H:14, I:-1, J:8, K:6, L:-5, M:6, N:-5, O:8, P:4 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:12, B:-4, C:-3, D:-4, E:12, F:8, G:0, H:7, I:12, J:4, K:2, L:-3, M:10, N:0, O:2, P:-4 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:7, B:3, C:7, D:14, E:-2, F:11, G:4, H:1, I:-3, J:1, K:10, L:11, M:2, N:-5, O:14, P:0 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:11, B:-2, C:8, D:-3, E:-3, F:11, G:5, H:1, I:-2, J:-2, K:9, L:-2, M:2, N:13, O:-4, P:7 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:4, B:5, C:6, D:7, E:3, F:14, G:2, H:10, I:-5, J:12, K:12, L:14, M:7, N:8, O:-2, P:-5 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:-5, B:0, C:9, D:-3, E:10, F:-1, G:-5, H:7, I:14, J:9, K:3, L:9, M:9, N:-4, O:1, P:-4 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:0, B:4, C:8, D:3, E:-2, F:7, G:9, H:10, I:8, J:0, K:14, L:10, M:-2, N:-2, O:13, P:11 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:14, B:3, C:5, D:4, E:-4, F:1, G:0, H:8, I:1, J:4, K:-3, L:11, M:0, N:2, O:11, P:-5 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:-4, B:8, C:12, D:8, E:11, F:8, G:6, H:12, I:8, J:14, K:5, L:13, M:11, N:0, O:6, P:2 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:12, B:1, C:0, D:8, E:1, F:1, G:-2, H:3, I:1, J:2, K:8, L:8, M:6, N:-2, O:12, P:6 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:5, B:13, C:6, D:-1, E:1, F:3, G:3, H:-2, I:4, J:-3, K:4, L:-1, M:2, N:1, O:2, P:-5 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:11, B:-2, C:6, D:0, E:-2, F:12, G:5, H:11, I:14, J:3, K:5, L:-4, M:7, N:4, O:11, P:-4 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:3, B:0, C:-1, D:-1, E:13, F:-1, G:-1, H:11, I:3, J:-1, K:11, L:-4, M:9, N:4, O:8, P:9 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:0, B:10, C:1, D:9, E:0, F:-3, G:-3, H:10, I:-2, J:11, K:4, L:1, M:9, N:5, O:3, P:-3 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:14, B:-3, C:2, D:-4, E:4, F:-2, G:5, H:8, I:7, J:8, K:14, L:8, M:13, N:10, O:-3, P:-5 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:8, B:-5, C:14, D:9, E:1, F:1, G:7, H:10, I:3, J:-3, K:2, L:8, M:12, N:7, O:-4, P:0 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:5, B:2, C:-2, D:1, E:11, F:13, G:-4, H:13, I:14, J:9, K:6, L:6, M:4, N:10, O:12, P:13 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:2, B:13, C:-2, D:-5, E:1, F:2, G:0, H:1, I:-4, J:6, K:-3, L:3, M:0, N:-3, O:5, P:9 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:11, B:10, C:12, D:8, E:10, F:-4, G:9, H:10, I:-3, J:5, K:9, L:-5, M:-1, N:13, O:5, P:5 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:10, B:-4, C:4, D:3, E:-4, F:-2, G:11, H:2, I:3, J:8, K:11, L:5, M:5, N:9, O:2, P:6 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:9, B:11, C:10, D:5, E:0, F:8, G:1, H:-2, I:-3, J:8, K:-5, L:3, M:-1, N:8, O:9, P:-1 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:11, B:12, C:10, D:-5, E:7, F:4, G:6, H:1, I:-1, J:9, K:2, L:12, M:2, N:14, O:5, P:4 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:2, B:2, C:2, D:-3, E:12, F:5, G:0, H:3, I:5, J:-2, K:-4, L:5, M:14, N:-5, O:3, P:4 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

../_images/example_tree.png

Consider the minimax tree above with the following values: A:4, B:-3, C:-5, D:12, E:-1, F:-3, G:-4, H:1, I:-4, J:10, K:-2, L:6, M:5, N:-5, O:1, P:-2 Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility. If Max is the root, what is the minimax value of the root?

Posting submission...