Correct Answer : Min/Max algorithm
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. The Min/Max algorithm is the preferred one over other search algorithms, as it provides the best move to the player, assuming that the opponent is also playing Optimally.
