UGC NET CSE | June 2016 | Part 3 | Question: 73

Question

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. $I$
• B. $HI$
• C. $CHI$
• D. $GHI$

Answer 1

here is my solution

Answer 2

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

Comments

Sir,

Suppose min of C is 6. Or changed the value of node G  is 13.

So, answer is GH ...I am right sir,

---

no in that case nothing is pruned as we have to check the values to know the minimum .     as search is from left to right  we need to know the values of g h i  so no one can be pruned

Answer 3

Follow this link: https://www.csee.umbc.edu/courses/671/fall09/exams/mt2009answers.pdf