The minimax algorithm 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
I had been asked this question in homework.
The doubt is from Game Theory in section Adversarial Search of Artificial Intelligence
