Which search is equal to minimax search but eliminates the branches that can't influence...
Optym technical mcq question, verified with a worked answer. Free to practise - no sign-up.
Which search is equal to minimax search but eliminates the branches that can't influence the final decision?
Show answer & explanation
Answer: D. D) Alpha-beta pruning
Alpha-beta pruning achieves the identical decision as minimax search while pruning subtrees that are mathematically proven to not influence the final minimax evaluation.
Step-by-step Derivation:
Step 1: Minimax traverses all game tree states up to a depth limit.
Step 2: Alpha-beta pruning tracks alpha (best choice for MAX) and beta (best choice for MIN).
Step 3: When a branch cannot improve the outcome, it is pruned, saving computation while guaranteeing the same result.