Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?
(a) Depth-first search
(b) Breadth-first search
(c) Alpha-beta pruning
(d) None of the mentioned
I have been asked this question at a job interview.
Origin of the question is Alpha Beta Pruning in division Adversarial Search of Artificial Intelligence