Adversarial Search, Minimax and Alpha-Beta Pruning Previous Year Questions (PYQs) for GATE DA: 3+ Solved Questions with Step-by-Step Solutions

    Solve 3+ Adversarial Search, Minimax and Alpha-Beta Pruning previous year questions for GATE DA with answers and detailed solutions. Free sample questions below.

    Chapter Roadmap: Adversarial Search

    1
    Minimax Game Tree Evaluation and Strategy Selection
    Foundation of adversarial search. Learn how MAX and MIN agents propagate utility values from terminal states to the root to select optimal strategies in deterministic, perfect-information games.
    Importance: High | Core Dependency for all game-playing AI
    2
    Alpha-Beta Pruning Bounds and Interpretation
    Optimization of minimax. Learn to maintain alpha and beta bounds to identify and prune branches that cannot possibly influence the final decision, without changing the final result.
    Importance: Moderate to High | Frequent Exam Application

    Topic Hero: The Minimax Intuition

    The Adversarial Setting

    Minimax applies strictly to games with three properties:

    • Two-player: Exactly two agents taking turns.
    • Zero-sum: The utility of the game is strictly opposed. If MAX gains , MIN effectively gains .
    • Perfect information: No hidden states or chance elements (no dice, no hidden cards).

    The Core Assumption

    The algorithm is built on a single, critical premise: The opponent plays optimally. When MAX evaluates a move, it does not hope for MIN to make a mistake. It assumes MIN will always choose the branch that yields the lowest possible utility for MAX. Therefore, MAX's strategy is to maximize the minimum possible payoff (hence, "Minimax").

    Adversarial Search, Minimax and Alpha-Beta Pruning: Solved Questions with Step-by-Step Explanations (3 Problems)

    Question 1 · Artificial Intelligence MCQ
    Consider the following statement:
    In adversarial search, – pruning can be applied to game trees of any depth where
    is the (m) value choice we have formed so far at any choice point along the
    path for the MAX player and is the (n) value choice we have formed so far
    at any choice point along the path for the MIN player.
    Which ONE of the following choices of (m) and (n) makes the above statement
    valid?
    1. A.

      (m) = highest, (n) = highest

    2. B.

      (m) = lowest, (n) = highest

    3. C.

      (m) = highest, (n) = lowest

    4. D.

      (m) = lowest, (n) = lowest

    Question 2 · Artificial Intelligence NAT
    Consider the game tree for a two-player turn-taking minimax game as shown in the figure. The value of a terminal node represents the utility of the game state if the game ends there. The numbers written next to the edges denote the strategies.

    There are two players MAX and MIN. At any particular state of the game, MAX prefers to move to a state of maximum value. On the other hand, MIN prefers to move to a state of minimum value.

    Suppose MAX starts the game at the root and has three strategies: 1, 2 and 3. Next, MIN plays and also has three strategies: 1, 2 and 3. The game ends there. Both players always take optimal strategies throughout the game.

    At the root, the best strategy for MAX is ___________ . (Answer in integer)
    MAX MIN 1 2 3 1 2 3 8 6 −1 1 2 3 1 5 7 1 2 3 −4 −3 −12
    Question 3 · Artificial Intelligence MCQ
    Consider game trees Tree-1 and Tree-2 as shown. The first level is a MAX agent and the second level is a MIN agent. The value in the square node is the output of the utility function.

    MAX MIN A 2 B x 1 Tree-1 C D E 5 y 2 Tree-2
    For what ranges of and , the right child of node and the right child of node will be pruned by alpha-beta pruning algorithm?
    1. A.

      and

    2. B.

      and

    3. C.

      and

    4. D.

      and

    More previous year questions (pyqs) in this unit

    chapter
    Adversarial Search, Minimax and Alpha-Beta Pruning Previous Year Questions (PYQs) for GATE DA: 3+ Solved Questions with Step-by-Step Solutions

    Solve 3+ Adversarial Search, Minimax and Alpha-Beta Pruning previous year questions for GATE DA with answers and detailed solutions. Free sample questions bel

    A question from this chapter

    Question 1
    Consider the following statement:
    In adversarial search, – pruning can be applied to game trees of any depth where
    is the (m) value choice we have formed so far at any choice point along the
    path for the MAX player and is the (n) value choice we have formed so far
    at any choice point along the path for the MIN player.
    Which ONE of the following choices of (m) and (n) makes the above statement
    valid?
    Question 2
    Consider the game tree for a two-player turn-taking minimax game as shown in the figure. The value of a terminal node represents the utility of the game state if the game ends there. The numbers written next to the edges denote the strategies.

    There are two players MAX and MIN. At any particular state of the game, MAX prefers to move to a state of maximum value. On the other hand, MIN prefers to move to a state of minimum value.

    Suppose MAX starts the game at the root and has three strategies: 1, 2 and 3. Next, MIN plays and also has three strategies: 1, 2 and 3. The game ends there. Both players always take optimal strategies throughout the game.

    At the root, the best strategy for MAX is ___________ . (Answer in integer)
    MAX MIN 1 2 3 1 2 3 8 6 −1 1 2 3 1 5 7 1 2 3 −4 −3 −12
    Question 3
    Consider game trees Tree-1 and Tree-2 as shown. The first level is a MAX agent and the second level is a MIN agent. The value in the square node is the output of the utility function.

    MAX MIN A 2 B x 1 Tree-1 C D E 5 y 2 Tree-2
    For what ranges of and , the right child of node and the right child of node will be pruned by alpha-beta pruning algorithm?
    Free preview ends here

    Login to view the complete previous-year questions and solutions

    Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.

    Login to continueSee plans
    Why MastersUp

    Personalised first. High quality throughout.

    Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.

    Built around you, not around a syllabus PDF

    Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.

    Revision that hits your weak spots

    We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.

    Questions calibrated to the real exam

    Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.

    Notes written for recall, not for volume

    Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.

    One place for everything

    Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.

    Honest progress

    No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.

    Unlock the whole course

    Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.

    View all plansStart free