GATE DA 2024 DA Q25: data-science

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?

Your answerChoose one option.

(m) = highest, (n) = highest

(m) = lowest, (n) = highest

(m) = highest, (n) = lowest

(m) = lowest, (n) = lowest

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

EXPLORE & PRACTISE

Paper and topic context

See where this question comes from and choose what to practise next.

Explore more previous year questions using this question’s imported topic tags.

You’re not logged in. Log in or create an account to see discussions and add comments.