Adversarial Search

• A lot of games are adversarial. You move, then your opponent moves.
• You try to maximize, while he minimizes.
• A minimax tree is a good result here.
• You make a tree of the state space.
• You enumerate your moves, and then expand the opponent's moves.
• If you can do all the moves, weight the leaves.
• You maximise, and assume that your opponent minimizes.
• Choose your next move based on this.
• Try to do this for Tic-Tac-Toe.