Suppose we MODIFY the problem and the game becomes an adversarial game as follows: the two players take turns moving; a coin is flipped to determine the puzzle on which to make a move in that turn; and the winner is the first to solve just ONE puzzle. Which algorithm can be used to choose a move in this setting?

Group of answer choices

Use MINMAX algorithm

Use EXPECTI$-$MINMAX algorithm

There should be two kinds of nodes in the search tree, min node and max node.

There should be three kinds of nodes in the search tree, min node, max node and chance node.