Question
Data Science and Artificial Intelligence Question on Representation of Binary Tree
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 ?
A
(m) = highest, (n) = highest
B
(m) = lowest, (n) = highest
C
(m) = highest, (n) = lowest
D
(m) = lowest, (n) = lowest
Answer
(m) = highest, (n) = lowest
Explanation
Solution
The correct option is (C) : (m) = highest, (n) = lowest.