APPLICATION OF SUPERVISED LEARNING
ARTIFICIAL INTELLIGENCE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Heuristic Search Algorithm
|
|
|
DFS/BFS algorithm
|
|
|
Greedy Search Algorithm
|
|
|
Min/Max algorithm
|
Detailed explanation-1: -10) Which algorithm is used in the Game tree to make decisions of Win/Lose? Explanation: A game tree is a directed graph whose nodes represent the positions in Game and edges represent the moves. To make any decision, the game tree uses the Min/Max algorithm.
Detailed explanation-2: -If we think of a game in terms of these 2 players, Max & Min, changing turns with each other, then we can represent the game as a tree of decisions.
Detailed explanation-3: -In game theory, minimax is a decision rule used to minimize the worst-case potential loss; in other words, a player considers all of the best opponent responses to his strategies, and selects the strategy such that the opponent’s best strategy gives a payoff as large as possible.