1. General games involves
a. Single-agent
b. Multi-agent
c. Neither a nor b
d. Only a and b
Answer: (d).Only a and b

2. Adversarial search problems uses
a. Competitive Environment
b. Cooperative Environment
c. Neither a nor b
d. Only a and b
Answer: (a).Competitive Environment

3. The initial state and the legal moves for each side define the __________ for the game.
a. Search Tree
b. Game Tree
c. State Space Search
d. Forest
Answer: (b).Game Tree

4. General algorithm applied on game tree for making decision of win/lose is ____________.
a. DFS/BFS Search Algorithms
b. Heuristic Search Algorithms
c. Greedy Search Algorithms
d. MIN/MAX Algorithms
Answer: (d).MIN/MAX Algorithms

5. 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 mentioned
Answer: (c).Alpha-beta pruning

6. Which search is similar to minimax search?
a. Hill-climbing search
b. Depth-first search
c. Breadth-first search
d. All of the mentioned
Answer: (b).Depth-first search

7. 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).Depends on the nodes

8. Which is identical to the closed list in Graph search?
a. Hill climbing search algorithm
b. Depth-first search
c. Transposition table
d. None of the mentioned
Answer: (c).Transposition table

9. Which function is used to calculate the feasibility of whole game tree?
a. Evaluation function
b. Transposition
c. Alpha-beta pruning
d. All of the mentioned
Answer: (a).Evaluation function

10. 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 mentioned
Answer: (b).Hash table of previously seen positions

Page 1 of 4
prepbytes affliate link