JOIN ADRE 2.0 Telegram Group

Artificial Intelligence Questions and Answers – Game Theory | Game Theory Multiple Choice Questions and Answers

Questions
1 General games involves ____________
A Single-agent
B Multi-agent
C Neither Single-agent nor Multi-agent
D Only Single-agent and Multi-agent

Answer: Only Single-agent and Multi-agent
2 Adversarial search problems uses ____________
A Competitive Environment
B Cooperative Environment
C Neither Competitive nor Cooperative Environment
D Only Competitive and Cooperative Environment

Answer: Competitive Environment
Advertisement
ADRE 2.0 Mock Test - 5 Start Test
ADRE 2.0 Mock Test - 5 Start Test

DOWNLOAD CURRENT AFFAIRS PDF FROM APP

3 Mathematical game theory, a branch of economics, views any multi-agent environment as a game provided that the impact of each agent on the others is “significant,” regardless of whether the agents are cooperative or competitive.
A True
B False

Answer: True
4 Zero sum games are the one in which there are two agents whose actions must alternate and in which the utility values at the end of the game are always the same.
A True
B False

Answer: False
5 Zero sum game has to be a ______ game.
A Single player
B Two player
C Multiplayer
D Three player

Answer: Multiplayer
6 A game can be formally defined as a kind of search problem with the following components.
A Initial State
B Successor Function
C Terminal Test
D All of the mentioned

Answer: All of the mentioned
7 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: Game Tree
8 General algorithm applied on game tree for making decision of win/lose is ____________
A DFS/BFS Search Algorithms
B Heuristic Search Algorithms
B Greedy Search Algorithms
B MIN/MAX Algorithms

Answer: MIN/MAX Algorithms
9 The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds.
A True
B False

Answer: True
10 What is the complexity of minimax algorithm?
A Same as of DFS
B Space – bm and time – bm
C Time – bm and space – bm
D Same as BFS

Answer: Same as of DFS

ADRE 2.0 MOCK TEST

Take Mock Tests

Government Schemes Mock Test Start Test!
Political Science Mock Test – 42 Start Test
History Test – 190 Start Test
Quantitative Aptitude Test Start Test!
Trigonometry - Mock Test Start Test!
Data Interpretation - Mock Test Start Test!
General Awareness - Mock Test Start Test!
Reasoning Ability - Mock Test Start Test!
Englist(Antonyms) Mock Test 1 Start Test!
Quantitative Aptitude (Percentage) Mock Test Start Test!
Economy Mock Test 1 Unlock Test!
Books & Authors - Test 2 Unlock Test!
Advertisement