Explanation: Alpha–beta pruning can be applied to trees of any depth and it is possible to prune entire sub-tree rather than leaves. 10. Which values are independent in minimax search algorithm?
A. Pruned leaves x and y
B. Every state is dependent
C. Root is independent
D. None of the mentioned
Answer:A
Explanation: Alpha–beta pruning can be applied to trees of any depth and it is possible to prune entire sub-tree rather than leaves. 10. Which values are independent in minimax search algorithm?
A. Pruned leaves x and y B. Every state is dependent C. Root is independent D. None of the mentioned
Explanation: The minimax decision are independent of the values of the pruned values x and y because of the root values. Sanfoundry Global Education & Learning Series – Artificial Intelligence.