Question

General algorithm applied on game tree for making decision of win/lose is ____________

(a) DFS/BFS Search Algorithms

(b) Heuristic Search Algorithms

(c) Greedy Search Algorithms

(d) MIN/MAX Algorithms

I had been asked this question in an online quiz.

Enquiry is from Game Theory in section Adversarial Search of Artificial Intelligence

Answer 1

Correct answer is (d) MIN/MAX Algorithms

To explain: Given a game tree, the optimal strategy can be determined by examining the min/max value of each node, which we write as MINIMAX- VALUE(n). The min/max value of a node is the utility (for MAX) of being in the corresponding state, assuming that both players play optimally from there to the end of the game. Obviously, the min/max value of a terminal state is just its utility. Furthermore, given a choice, MAX will prefer to move to a state of maximum value, whereas MIN prefers a state of minimum value.