Explanation: The minimax search is depth-first search, So at one time we just have to consider the nodes along a single path in the tree. 5. Which value is assigned to alpha and beta in the alpha-beta pruning?
A. Alpha = max
B. Beta = min
C. Beta = max
D. Both a & b
Answer:A
Explanation: The minimax search is depth-first search, So at one time we just have to consider the nodes along a single path in the tree. 5. Which value is assigned to alpha and beta in the alpha-beta pruning?
A. Alpha = max B. Beta = min C. Beta = max D. Both a & b
Explanation: Alpha and beta are the values of the best choice we have found so far at any choice point along the path for MAX and MIN. 6. Where are the values of alpha-beta search updated?