Explanation: Alpha–beta pruning can be applied to trees of any depth and it is possible to prune entire sub tree rather than leaves. 4. Which search is similar to minimax search?
A. Hill-climbing search
B. Depth-first search
C. Breadth-first search
D. All 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. 4. Which search is similar to minimax search?
A. Hill-climbing search B. Depth-first search C. Breadth-first search D. All of the mentioned
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?