Maths Olympiad Prep

Library / /70 of 158

Combinatorics Difficulty 5.7 AIME, harder Prove it Estonia

There are 8 white pawns on the squares at one edge of an 8×88 \times 8 chessboard and 8 black pawns on the squares at the opposite edge. On each move, a player shifts one of his pawns by one or more squares forward (toward the opponent's piece) or backward, but moving a pawn to a square containing the opponent's pawn or over such a square is prohibited. Moves are performed alternately, with white starting. The player who cannot make a move loses. Which player has a winning strategy?

Solution

Black can use the following strategy. If white moves his kkth pawn counting from his left, by nn squares forward, black moves his kkth pawn counting from his left, by nn squares forward. If white moves his pawn by nn squares backward, black moves his pawn on the same file by nn squares forward. After each move made by black, the distance between two pawns on each file is the same as that on the file symmetric w.r.t. the midpoint of the board. Thus whenever a white pawn has moved forward, the black can make the move determined by the strategy described. As the black pawns move forward only, white will be paralyzed sooner or later.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.