Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Multiple Choice Questions
Q291: The static evaluator in a minimax tree assigns what to each node?
- A: A heuristic rule
- B: A complexity class
- C: A static evaluation score
- D: A random number
View Answer
C
Q292: In the minimax game tree, who selects the move after the maximizer's move?
- A: Arbiter
- B: Judge
- C: Minimizer
- D: Another maximizer
View Answer
C
Q293: Minimizer always tries to force the maximizer into a position with the _______ score.
- A: Highest
- B: Predictable
- C: Random
- D: Lowest
View Answer
D
Q294: In adversarial search, the look-ahead strategy is used to ________.
- A: Skip levels
- B: Reduce memory
- C: Understand future game states
- D: Predict user inputs
View Answer
C
Q295: Which strategy improves minimax by reducing the number of nodes evaluated?
- A: Hill Climbing
- B: Best First Search
- C: Alpha Beta Pruning
- D: Depth First Search
View Answer
C
Q296: Alpha Beta Pruning works by _______ the branches that do not affect the final decision.
- A: Evaluating
- B: Expanding
- C: Pruning
- D: Reversing
View Answer
C
Q297: Alpha Beta Pruning reduces the number of _______ evaluations.
- A: Heuristic
- B: Static
- C: Dynamic
- D: Total
View Answer
B
Q298: What is the purpose of a static evaluator in the minimax algorithm?
- A: To create game levels
- B: To choose random paths
- C: To score game positions
- D: To delete unused nodes
View Answer
C
Q299: The term "solution space" in problem solving refers to ________.
- A: All possible answers
- B: All possible states
- C: All user responses
- D: None of these
View Answer
B
Q300: In problem solving, "operators" represent _______.
- A: Rules to reach the goal
- B: Static values
- C: Input devices
- D: Random guesses
View Answer
A