Imagine a row of 2000 squares. Two players in turn write either
an S or an O in an empty square. The first player who produces three consecutive boxes that spell SOS
wins. If all boxes are filled without producing SOS then the game is a draw.
Prove that the second
player has a winning strategy.