Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alpha-beta pruning?
Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alpha-beta pruning?
A (MAX) has children B and C (MIN nodes).
B has leaf children D = 3, E = 12, F = 8.
C has leaf children G = 2, H = 15, I = 6.
Show answerHide answer
Correct answer: (B) HI
Explanation
B is a MIN node: min(3, 12, 8) = 3, so A (MAX) gets α = 3. At C, the first leaf G = 2 gives C a value ≤ 2, which is less than α = 3. Whatever H and I produce, C cannot be chosen by A, so H and I are pruned. Option (b) is correct.