V1 U1 ՂԱԶ 02 04 V3 10 10 2 4 8 3 0 3 7 9 0 12 Figure 2: A minimax search tree.
Let's look at the minimax search tree illustrated in Figure 2. In this diagram, black nodes represent decisions made by the MAX player, while white nodes represent decisions made by the MIN player. The squares at the terminal nodes represent payments, with the number indicating the amount paid from MIN to MAX (a 0 indicates no payment from MIN to MAX). MAX aims to maximize the payment they receive, while MIN aims to minimize the payment they make. If we apply 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?
Step by step
Solved in 1 steps
