Which search strategy analyzes moves by considering the opponent's best counterplay (minimax)?

Get ready for the GARP Risk and AI Exam with flashcards and multiple choice questions. Each question comes with hints and explanations. Prepare for success!

Adversarial search is about modeling a game as a contest against an opponent who aims to minimize your outcome. In a minimax approach, you assume the opponent will choose their best countermove, and you pick a move that maximizes your eventual payoff given that assumption. You map out a game tree with moves for both players, evaluate positions at the leaves (or at a chosen depth with a heuristic), and then propagate those values backward by alternating between maximizing your score on your turns and minimizing it on the opponent’s turns. This captures the idea of planning for the worst case against a perfectly playing opponent, which is exactly what minimax represents. The other terms don’t describe a strategy for handling an opponent’s counterplay—recursion is just a general technique to traverse the tree, while brittleness and lack of understanding aren’t search strategies.