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?

GATE DA 2024 Q25: Meaning of alpha and beta in alpha–beta pruning

Artificial Intelligence
1 mark
MCQ
−1/3 if wrong

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?

Try it: multiple choice: exactly one correct option

Wrong answer costs 1/3 mark in GATE.

Show answer and explanation

Answer: C (official GATE 2024 final answer key)

Concept used: Alpha–beta pruning: $\alpha$ is MAX's best guaranteed value, $\beta$ is MIN's best guaranteed value.

First step: MAX wants the highest value, MIN the lowest; $\alpha$ and $\beta$ track the best choice each has found so far.

Full step-by-step solution

Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.

Share this question

WhatsAppDownload image

Source: official GATE 2024 DA question paper and final answer key, organised by IISc Bangalore. Question paper · Answer key

PracticePractise Artificial Intelligence questions →Full paperAll GATE DA 2024 questions →

GATE DA 2024 Q25: Meaning of alpha and beta in alpha–beta pruning

Question

Full step-by-step solution

More Artificial Intelligence PYQs