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?
A. Depends on the nodes
B. Depends on the order in which they are executed
C. Both a & b
D. None of the mentioned
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. 3. How the effectiveness of the alpha-beta pruning gets increased?
A. Depends on the nodes B. Depends on the order in which they are executed C. Both a & b D. None of the mentioned
Explanation: None. 4. Which is identical to the closed list in Graph search?