Artificial intelligence (AI) Question:

Download Job Interview Questions and Answers PDF

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

Artificial intelligence Interview Question
Artificial intelligence Interview Question

Answer:

a) True
Explanation: Refer definition of minimax algorithm.

Download Artificial intelligence Interview Questions And Answers PDF

Previous QuestionNext Question
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
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