Skip to content
Related Articles

Related Articles

Save Article
Improve Article
Save Article
Like Article

UGC-NET | UGC NET CS 2016 July – III | Question 73

  • Last Updated : 27 Apr, 2018

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 ?
73
(A) I
(B) HI
(C) CHI
(D) GHI


Answer: (B)

Explanation:
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. For more information on Game theory Refer:Minimax Algorithm in Game Theory | Set 4 (Alpha-Beta Pruning)
Option (B) is correct.


Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :