GARP Risk And AI (RAI) Practice Exam

Adversarial search models competitive environments where two players have opposing goals, such as in chess or checkers. It assumes the opponent will act to minimize your chances, and it uses the minimax principle to plan moves accordingly. In practice, you lay out a game tree of possible moves and responses. On your turn you pick the move that leads to the best outcome assuming the opponent will respond with the move that minimizes your eventual score. This step-by-step reasoning yields the minimax value for each position and guides the best move to choose. Alpha-beta pruning is a common enhancement that trims unnecessary branches to speed up the search without changing the result. The other terms aren’t strategies for planning under an opponent’s influence: combinational explosion describes the rapid growth of possibilities as a problem scales, recursion is a general technique for breaking problems into simpler ones, and brittleness refers to a system’s lack of robustness.