Suppose you have an oracle, $OM(s)$, that correctly predicts the
opponentâ€™s move in any state. Using this, formulate the definition of a
game as a (single-agent) search problem. Describe an algorithm for
finding the optimal move.

Suppose you have an oracle, $OM(s)$, that correctly predicts the
opponentâ€™s move in any state. Using this, formulate the definition of a
game as a (single-agent) search problem. Describe an algorithm for
finding the optimal move.