Question

Consider the following game tree, where one of the leaves has an unknown payoff, x. Player 1 moves first and attempts to maximize the value of the game.
A) Minimax algorithm
B) Alpha-beta pruning
C) Nash equilibrium
D) Monte Carlo Tree Search