V1 U1 ՂԱԶ 02 04 V3 10 10 2 4 8 3 0 3 7 9 0 12 Figure 2: A minimax search tree.
Consider the minimax search tree below (Figure 2). In the figure, black nodes are controlled
by the MAX player, and white nodes are controlled by the MIN player. Payments (terminal nodes)
are squares; the number within denotes the amount that the MIN player pays to the MAX player (an
amount of 0 means that MIN pays nothing to MAX). Naturally, MAX wants to maximize the amount
they receive, and MIN wants to minimize the amount they pay.
Suppose that we use the α-β pruning
(a) Assume that we iterate over nodes from right to left; what are the arcs that are pruned
by α-β pruning, if any?
(b) Does you answer change if we iterate over nodes from left to right?
Trending now
This is a popular solution!
Step by step
Solved in 1 steps
