Which values are independant in minimax search algorithm?
(a) Pruned leaves x and y
(b) Every states are dependant
(c) Root is independant
(d) None of the mentioned
This question was addressed to me during an interview.
My query is from Alpha Beta Pruning topic in portion Adversarial Search of Artificial Intelligence