1. : Which of the following is the complexity of minimax algorithm?
(A) Same as BFS
(B) Space – bm and time – bm
(C) Time – bm and space – bm
(D) Same as of DFS
2. : How many players in a Zero-sum game?
(A) Single player
(B) Two player
(C) Three player
(D) Multiplayer
3. : We can formally define a game as a type of search problem with the ……… components.
(A) Initial State
(B) Successor Function
(C) Terminal Test
(D) All of these
4. : Which of the following is the general algorithm that can be applied on a game tree for deciding win or lose?
(A) DFS/BFS Search Algorithms
(B) MIN/MAX Algorithms
(C) Greedy Search Algorithms
(D) Heuristic Search Algorithms
5. : General games involve what kind of agents?
(A) Single-agent
(B) Multi-agent
(C) Only Single-agent and Multi-agent
(D) Neither Single-agent nor Multi-agent
6. : Adversarial search problems use which of the following environment?
(A) Only Competitive and Cooperative Environment
(B) Cooperative Environment
(C) Neither Competitive nor Cooperative Environment
(D) Competitive Environment
7. : Which of the following for the game can be defined by the initial state and the legal moves for each side?
(A) Search Tree
(B) Forest
(C) State Space Search
(D) Game Tree