The search algorithm which is similar to the minimax search, but removes the branches that don't affect the final output is known as__.
Answer: c. Alpha-beta pruning
Explanation: Alpha-beta pruning algorithm is the modified version of the Minimax algorithm and returns the same moves as the original algorithm, but it removes all those nodes/branches that do not affect the final decision.