Question 77
Alice and Bob are playing a game of Token Tag, played on an $8 \times 8$ chessboard. At the beginning of the game, Bob places a token for each player on the board. After this, in every round, Alice moves her token, then Bob moves his token. If at any point in a round the two tokens are on the same square, Alice immediately wins. If Alice has not won by the end of 2012 rounds, then Bob wins.
a. Suppose that a token can legally move to any horizontally or vertically adjacent square. Show that Bob has a winning strategy for this game.
b. Suppose instead that a token can legally move to any horizontally, vertically, or diagonally adjacent square. Show that Alice has a winning strategy for this game.
a. Suppose that a token can legally move to any horizontally or vertically adjacent square. Show that Bob has a winning strategy for this game.
b. Suppose instead that a token can legally move to any horizontally, vertically, or diagonally adjacent square. Show that Alice has a winning strategy for this game.