Question

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

Select the correct answer from above options

Interview Questions and Answers, Database Interview Questions and Answers for Freshers and Experience

Answer 1

The correct option is (a) Pruned leaves x and y

Best explanation: The minimax decision are independant of the values of the pruned values x and y because of the root values.