⟩ 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
c) Transposition table
Question and Answer:
Home AI Games
- Share
Popular Answers:
* There is no answer to the above question yet.
More Questions for you:
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
The complexity of minimax algorithm is a) Same as of DFS b) Space - bm and time - bm c) Time - bm and space - bm d) Same as BFS
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. a) True b) False
Zero sum game has to be a ______ game. a) Single player b) Two player c) Multiplayer d) Three player
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
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
Adversarial search problems uses, a) Competitive Environment b) Cooperative Environment c) Neither a nor b d) Only a and b
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
Consider this after a while Tesuaros temporal difference program will likely stop learning, so does this means that it lost its intelligence?
Is this artificial intelligence lives over the other software programs and their flexibility?
