V1 U1 ՂԱԶ 02 04 V3 10 10 2 4 8 3 0 3 7 9 0 12 Figure 2: A minimax search tree.

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter17: Linked Lists
Section: Chapter Questions
Problem 3SA
icon
Related questions
Question

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 algorithm, we can analyze the minimax tree as shown in Figure 2.

(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?

V1
U1
ՂԱԶ
02
04
V3
10
10
2
4
8
3
0
3
7 9
0
12
Figure 2: A minimax search tree.
Transcribed Image Text:V1 U1 ՂԱԶ 02 04 V3 10 10 2 4 8 3 0 3 7 9 0 12 Figure 2: A minimax search tree.
Expert Solution
steps

Step by step

Solved in 1 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning