Artificial intelligence (AI) Question: Download Artificial intelligence PDF

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

b) Game Tree
Explanation:
An example of game tree for Tic-Tac-Toe game.

Previous Question	Next Question
Zero sum game has to be _______ game. a) Single player b) Two player c) Multiplayer d) Three player	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