Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?

Question

Q:

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

Select the correct answer from above options

Interview Questions and Answers, Database Interview Questions and Answers for Freshers and Experience

Answer 1

Correct choice is (c) Alpha-beta pruning

The explanation: The alpha-beta search computes the same optimal moves as minimax, but eliminates the branches that can’t influence the final decision.