Artificial Intelligence MCQ Questions - Alpha Beta Pruning
Alpha Beta Pruning MCQs : This section focuses on "Alpha Beta Pruning" in Artificial Intelligence. These Multiple Choice Questions (MCQ) should be practiced to improve the AI skills required for various interviews (campus interviews, walk-in interviews, company interviews), placements, entrance exams and other competitive examinations.
1. Alpha-beta pruning is a modified version of the?
A. minimin algorithm
B. maximax algorithm
C. minimax algorithm
D. maximin algorithm
View Answer
Ans : C
Explanation: Alpha-beta pruning is a modified version of the minimax algorithm
2. There is a technique by which without checking each node of the game tree we can compute the correct minimax decision, and this technique is called?
A. alpha-beta pruning
B. Alpha-Beta Algorithm
C. pruning
D. minimax algorithm
View Answer
Ans : C
Explanation: There is a technique by which without checking each node of the game tree we can compute the correct minimax decision, and this technique is called pruning.
3. The initial value of alpha is?
A. Negative Infinity
B. 0
C. Positive Infinity
D. 1
View Answer
Ans : A
Explanation: The initial value of alpha is Negative Infinity.
4. The initial value of beta is ?
A. Negative Infinity
B. 0
C. Positive Infinity
D. -1
View Answer
Ans : C
Explanation: The initial value of beta is Positive Infinity.
5. The main condition which required for alpha-beta pruning is?
A. alpha<=beta
B. alpha>=beta
C. alpha=beta
D. alpha!=beta
View Answer
Ans : B
Explanation: The main condition which required for alpha-beta pruning is: alpha>=beta.
6. How many types of Move Ordering in Alpha-Beta pruning?
A. 3
B. 4
C. 1
D. 2
View Answer
Ans : D
Explanation: It can be of two types: Worst ordering and Ideal ordering.
7. The time complexity for such an Worst order is?
A. O(b*m)
B. O(b^m)
C. O(b)
D. O(logb)
View Answer
Ans : B
Explanation: The time complexity for such an order is O(b^m).
8. Complexity in ideal ordering is ?
A. O(b*(m/2))
B. O(b^m)
C. O(b*m)
D. O(logb)
View Answer
Ans : A
Explanation: Complexity in ideal ordering is O(b^(m/2)).
9. While backtracking the tree, the node values will be passed to upper nodes instead of values of alpha and beta.
A. TRUE
B. FALSE
C. Can be true or false
D. Can not say
View Answer
Ans : A
Explanation: While backtracking the tree, the node values will be passed to upper nodes instead of values of alpha and beta.
10. The MIN player will only update the value of alpha.
A. TRUE
B. FALSE
C. Can be true or false
D. Can not say
View Answer
Ans : B
Explanation: The Max player will only update the value of alpha and the Min player will only update the value of beta.
11. Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?
A. Depth-first search
B. Breadth-first search
C. Alpha-beta pruning
D. None of the above
View Answer
Ans : C
Explanation: The alpha-beta search computes the same optimal moves as minimax, but eliminates the branches that can’t influence the final decision.
12. Which values are independant in minimax search algorithm?
A. Pruned leaves x and y
B. Every states are dependant
C. Root is independant
D. None of the above
View Answer
Ans : A
Explanation: The minimax decision are independant of the values of the pruned values x and y because of the root values.
13. To which depth does the alpha-beta pruning can be applied?
A. 10 states
B. 12 states
C. 8 states
D. Any States
View Answer
Ans : D
Explanation: Alpha–beta pruning can be applied to trees of any depth and it is possible to prune entire subtree rather than leaves.
14. Which search is similar to minimax search?
A. Hill-climbing search
B. Depth-first search
C. Breadth-first search
D. All of the above
View Answer
Ans : B
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.
15. Which value is assigned to alpha and beta in the alpha-beta pruning?
A. alpha = max
B. alpha = min
C. beta = min
D. Both A and C
View Answer
Ans : D
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.
16. Where does the values of alpha-beta search get updated?
A. Along the path of search
B. Initial state itself
C. At the end
D. None of the above
View Answer
Ans : A
Explanation: Alpha-beta search updates the value of alpha and beta as it gets along and prunes the remaining branches at node.
17. We will only pass the alpha, beta values to the child nodes.
A. TRUE
B. FALSE
C. Can be true or false
D. Can not say
View Answer
Ans : A
Explanation: We will only pass the alpha, beta values to the child nodes.
18. Which ordering consumes more time because of alpha-beta factors?
A. Ideal ordering
B. Worst ordering
C. Both A and B
D. None of the above
View Answer
Ans : B
Explanation: It also consumes more time because of alpha-beta factors, such a move of pruning is called worst ordering.
19. In which year Donald Knuth and Ronald W. Moore refined the algorithm?
A. 1970
B. 1975
C. 1980
D. 1985
View Answer
Ans : B
Explanation: Donald Knuth and Ronald W. Moore refined the algorithm in 1975.
20. What is called as transposition table?
A. Hash table of next seen positions
B. Hash table of previously seen positions
C. Next value in the search
D. None of the above
View Answer
Ans : B
Explanation: Transposition is the occurrence of repeated states frequently in the search.
Discussion