GATE 2024 DA – Question 25
Consider the following statement: In adversarial search, $\alpha$–$\beta$ pruning can be applied to game trees of any depth where $\alpha$ is the (m) value choice we have formed so far at any choice point along the path for the MAX player and $\beta$ 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?
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (C) (m) = highest, (n) = lowest
Explanation
$\alpha$ is the best (highest) value that MAX can already guarantee along the path, and $\beta$ is the best (lowest) value that MIN can already guarantee. A branch is pruned when $\alpha \ge \beta$.
More Search: informed, uninformed and adversarial questions
- GATE 2024 DA Q44
- GATE 2026 DA Q13
- GATE 2026 DA Q30
- GATE 2025 DA Q43
- GATE 2025 DA Q44
- GATE 2024 DA Q23
All Search: informed, uninformed and adversarial questions →