Question 21 : The minimax algorithm (Figure 6.3) 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.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 22 : General algorithm applied on game tree for making decision of win/lose is ____________
1. DFS/BFS Search Algorithms
2. Heuristic Search Algorithms
3. Greedy Search Algorithms
4. MIN/MAX Algorithms
View Answer   Discuss with Members

Question 23 : The initial state and the legal moves for each side define the __________ for the game.
1. Search Tree
2. Game Tree
3. State Space Search
4. Forest
View Answer   Discuss with Members

Question 24 : A game can be formally defined as a kind of search problem with the following components:
1. Initial State
2. Successor Function
3. Terminal Test
4. All of the mentioned
View Answer   Discuss with Members

Question 25 : Zero sum game has to be a ______ game.
1. Single player
2. Two player
3. Multiplayer
4. Three player
View Answer   Discuss with Members

Question 26 : 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.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 27 : 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.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 28 : General games involves
1. Single-agent
2. Multi-agent
3. Neither Single-agent nor Multi-agent
4. Only Single-agent and Multi-agent
View Answer   Discuss with Members