1) General games involves
Single-agent![]()
Multi-agent![]()
Neither Single-agent nor Multi-agent![]()
Only Single-agent and Multi-agent![]()
Answer : D Discuss
2) Adversarial search problems uses
Competitive Environment![]()
Cooperative Environment![]()
Neither Competitive nor Cooperative Environment![]()
Only Competitive and Cooperative Environment![]()
Answer : A Discuss
3) Zero sum game has to be a ______ game.
4) A game can be formally defined as a kind of search problem with the following components:
5) The initial state and the legal moves for each side define the __________ for the game.
6) General algorithm applied on game tree for making decision of win/lose is _______
DFS/BFS Search Algorithms![]()
Heuristic Search Algorithms![]()
Greedy Search Algorithms![]()
MIN/MAX Algorithms![]()
Answer : D Discuss
7) The complexity of minimax algorithm is
8) Which is the most straightforward approach for planning algorithm?
9) What are taken into account of state-space search?
10) How many ways are available to solve the state-space search?