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
Answer:A
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
Explanation: 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. 9. 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.