MathDB

1998 National Olympiad First Round

Part of National Olympiad First Round

Subcontests

(36)

Winning game strategy on chessboard

A two-player game is played on a chessboard with m m columns and n n rows. Each player has only one piece. At the beginning of the game, the piece of the first player is on the upper left corner, and the piece of the second player is on the lower right corner. If two squares have a common edge, we call them adjacent squares. The player having the turn moves his piece to one of the adjacent squares. The player wins if the opponent's piece is on that square, or if he manages to move his piece to the opponent's initial row. If the first move is made by the first player, for which of the below pairs of (m,n) \left(m,n\right) there is a strategy that guarantees the second player win.
<spanclass=latexbold>(A)</span> (1998,1997)<spanclass=latexbold>(B)</span> (1998,1998)<spanclass=latexbold>(C)</span> (997,1998)<spanclass=latexbold>(D)</span> (998,1998)<spanclass=latexbold>(E)</span> None <span class='latex-bold'>(A)</span>\ (1998, 1997) \qquad<span class='latex-bold'>(B)</span>\ (1998, 1998) \qquad<span class='latex-bold'>(C)</span>\ (997, 1998) \qquad<span class='latex-bold'>(D)</span>\ (998, 1998) \qquad<span class='latex-bold'>(E)</span>\ \text{None }