Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

1993 IMO Problems/Problem 3

Revision as of 15:34, 6 October 2023 by Tomasdiaz (talk | contribs) (Created page with "==Problem == On an infinite chessboard, a game is played as follows. At the start, <math>n^2</math> pieces are arranged on the chessboard in an <math>n</math> by <math>n</math...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

On an infinite chessboard, a game is played as follows. At the start, $n^2$ pieces are arranged on the chessboard in an $n$ by $n$ block of adjoining squares, one piece in 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.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1993_IMO_Problems/Problem_3&oldid=199204"