GATE DA 2024 Set 1 — Question 25
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33EasyAlpha-Beta PruningAdversarial SearchArtificial Intelligence
Artificial Intelligence → Adversarial Search → Alpha-Beta Pruning
Last updated
Question
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?
Correct answer
(C) (m) = highest, (n) = lowest
Solution
In the context of the Minimax algorithm with pruning:
- represents the best value (highest) that the maximizer (MAX) can guarantee at that level or above.
- represents the best value (lowest) that the minimizer (MIN) can guarantee at that level or above.
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE DA question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Adversarial Search
2026 Set 1 Q13Which of the following algorithms is NOT an example of uninformed search?2026 Set 1 Q14Which of the following statements is NOT true? (The names of the predicates are intuitive.)2026 Set 1 Q23In the following table, the
Task column lists a few tasks related to machine learning. The…2026 Set 1 Q24Sentence is said to entail Sentence if whenever is TRUE, also must hold TRUE. Which…2026 Set 1 Q30Consider the game tree for a two-player turn-taking minimax game as shown in the figure. The value…