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?
Follow this link: https://www.csee.umbc.edu/courses/671/fall09/exams/mt2009answers.pdf
here is my solution
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.
B tree insertion and deletion...