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

 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 algorithm. Consider the minimax tree given 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
trending now

Trending now

This is a popular 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