Explanation: The alpha-beta search computes the same optimal moves as minimax, but eliminates the branches that can’t influence the final decision. 2. 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: The alpha-beta search computes the same optimal moves as minimax, but eliminates the branches that can’t influence the final decision. 2. 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. 3. How the effectiveness of the alpha-beta pruning gets increased?