Artificial Intelligence Games Interview Question:

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

Submitted by: Administrator

a) True
Explanation: Refer definition of minimax algorithm.
Submitted by:

☺	What is AI Checkers?

☺	What is Game Playing AI?

☺	What is AI Backgammon?

☺	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?

☺	Virtual Assistant Interview Questions.

☺	Artificial Intelligence Robotics Interview Questions.

☺	AI Fuzzy Logic Interview Questions.

☺	Artificial Intelligence Neural Networks Interview Questions.

☺	Artificial Intelligence Games Interview Questions.