Introduction to Artificial Intelligence –
Problem Solving Algorithms in Games
20 Multiple Choice Questions (MCQs)
1. 1. What is the main goal of problem-solving algorithms in games?
A. To generate random moves
B. To confuse the opponent
C. To make optimal decisions based on game state
D. To slow down the game
Answer: C
2. 2. Which of the following is a turn-based, deterministic, and zero-sum game?
A. Chess
B. Snakes and Ladders
C. Sudoku
D. Minesweeper
Answer: A
3. 3. What type of search is generally used for solving games with two players?
A. Depth-first search
B. Minimax search
C. Hill-climbing
D. Simulated annealing
Answer: B
4. 4. A game is called zero-sum if:
A. One player’s gain is another player’s loss
B. Both players can win
C. Only one player plays
D. There is a draw always
Answer: A
5. 5. In a two-player game, what is the main purpose of the Minimax algorithm?
A. To learn from experience
B. To maximize only one player’s score
C. To minimize search depth
D. To find the optimal move assuming the opponent also plays optimally
Answer: D
6. 6. Which strategy enhances the Minimax algorithm by eliminating unnecessary
branches?
A. Greedy search
B. Alpha-Beta Pruning
C. A* Search
D. Randomized search
Answer: B
7. 7. What is a utility function in a game?
A. A measure of memory used
B. A function that evaluates the value of a game state
C. A method to draw graphics
D. A timing mechanism
Answer: B
8. 8. In game AI, what does “depth-limited search” help control?
A. Search speed
B. Visual complexity
C. Search depth in game trees
D. Player fatigue
Answer: C
9. 9. What is the best first move in a game according to the Minimax algorithm?
A. A random move
B. A move with the maximum immediate reward
C. The move that leads to the highest utility assuming optimal opponent play
D. The center square
Answer: C
10. 10. Which node type is NOT found in a typical game tree?
A. Terminal node
B. Chance node (in deterministic games)
C. Max node
D. Min node
Answer: B
11. 11. Which of these is an evaluation function used in games?
A. Manhattan distance
B. Game outcome prediction
C. Static board evaluation
D. Alpha growth
Answer: C
12. 12. Why are heuristics important in game playing AI?
A. They reduce memory usage
B. They provide a way to estimate utility when full search is impractical
C. They speed up graphics
D. They avoid rules
Answer: B
13. 13. Which search algorithm is used when uncertainty is introduced in games (like dice
rolls)?
A. Minimax
B. Alpha-beta
C. Expectimax
D. DFS
Answer: C
14. 14. In adversarial games, if both players use Minimax, the outcome is:
A. Unpredictable
B. Optimal for both
C. Biased
D. Random
Answer: B
15. 15. What type of games is Monte Carlo Tree Search best suited for?
A. Perfect-information games
B. Probabilistic games with large state spaces
C. Single-player puzzles
D. Grid games
Answer: B
16. 16. What is the time complexity of Minimax without pruning for a tree of depth d and b
branching factor?
A. O(d^b)
B. O(b + d)
C. O(b^d)
D. O(log b * d)
Answer: C
17. 17. Which AI technique is used in games like Go and Chess for advanced gameplay?
A. Decision Trees
B. Deep Reinforcement Learning
C. BFS
D. Rule-Based Systems
Answer: B
18. 18. What is the drawback of Minimax without pruning?
A. It only works on small games
B. It evaluates all nodes, making it slow
C. It cannot be used for turn-based games
D. It misses optimal moves
Answer: B
19. 19. In games, how is a winning state represented in utility?
A. -1
B. 0
C. 1
D. ∞
Answer: C
20. 20. Which of the following is true about Alpha-Beta pruning?
A. It affects the result of Minimax
B. It improves speed without affecting the final decision
C. It skips terminal states
D. It replaces Minimax
Answer: B
