Explanation: The alpha-beta search computes the same optimal moves as minimax, but eliminates the branches that cannot influence the final decision. 2. Which values are independent in minimax search algorithm?
A. Pruned leaves x and y
B. Every state is dependant
C. Root is independent
D. None of the mentioned
Answer:A
Explanation: The alpha-beta search computes the same optimal moves as minimax, but eliminates the branches that cannot influence the final decision. 2. Which values are independent in minimax search algorithm?
A. Pruned leaves x and y B. Every state is dependant 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. 3. To which depth does the alpha-beta pruning can be applied.