GATE DA 2024 — Question 25

AISearch: informed, uninformed, adversarialMCQ1 mark · −1/3 if wrongEasy

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?
  1. A
    (m) = highest, (n) = highest
  2. B
    (m) = lowest, (n) = highest
  3. C
    (m) = highest, (n) = lowest
  4. D
    (m) = lowest, (n) = lowest
Practise the full 2024 paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
Practise more on Search: informed, uninformed, adversarialTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group