• AI MCQ Topics

• AI Reference

• Other Reference

# 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

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

3. The initial value of alpha is?

A. Negative Infinity
B. 0
C. Positive Infinity
D. 1

4. The initial value of beta is ?

A. Negative Infinity
B. 0
C. Positive Infinity
D. -1

5. The main condition which required for alpha-beta pruning is?

A. alpha<=beta
B. alpha>=beta
C. alpha=beta
D. alpha!=beta

6. How many types of Move Ordering in Alpha-Beta pruning?

A. 3
B. 4
C. 1
D. 2

7. The time complexity for such an Worst order is?

A. O(b*m)
B. O(b^m)
C. O(b)
D. O(logb)

8. Complexity in ideal ordering is ?

A. O(b*(m/2))
B. O(b^m)
C. O(b*m)
D. O(logb)

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

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