The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
2.2k views

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?

  1. I
  2. HI
  3. CHI
  4. GHI
asked in Others by (27 points)
recategorized by | 2.2k views

4 Answers

0 votes
Since here we have to maximize A and minimize B and C (As per min max tree) min of B is 3 and min of C is 2 for sure( so there is no need of further expanding H and  I as whatever value their successor will produce will be immaterial ) hence H I are pruned

so ans is B
answered by Veteran (50.7k points)
0 votes
answered by Loyal (7.9k points)
0 votes

here is my solution

answered by (219 points)
0 votes


73 (1)
We have to maximize A and minimize B and C. Minimum of B is 3 and C is 2 But max from B is 12 and max from C is 15. So, there is no need of further expanding H and I. Because whatever value their successor will produce will be immaterial. Hence H I are pruned. 

 

Option (B) is correct.

answered by Active (1.8k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,121 questions
53,242 answers
184,708 comments
70,481 users