olymmath

IMO 1993 Problem 3

On an infinite chessboard a game is played as follows. At the start n2n^2 pieces are arranged in an n x n block of adjoining squares, one piece on each square. A move in the game is a jump in a horizontal or vertical direction over an adjacent occupied square to an unoccupied square immediately beyond. The piece which has been jumped over is removed. Find those values of n for which the game can end with only one piece remaining on the board.

Community text Kalva (prase.cz mirror). Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator imo/1993/p3 · Tag VJYPA9PB39 · Edit this page on GitHub · Keys: j next, k previous