Question:

Consider the following statement :
In adversarial search, α - β pruning can be applied to game trees of any depth where a 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 ?

Updated On: Jul 9, 2024
  • (m) = highest, (n) = highest
  • (m) = lowest, (n) = highest
  • (m) = highest, (n) = lowest
  • (m) = lowest, (n) = lowest
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

The correct option is (C) : (m) = highest, (n) = lowest.
Was this answer helpful?
0
0

Questions Asked in GATE AR exam

View More Questions