1.

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

Answer» 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.


Discussion

No Comment Found

Related InterviewSolutions