MathDB
Rearranging Chips on Infinite Plane

Source: 239 2000 J1

May 17, 2020
combinatorics

Problem Statement

On an infinite checkered plane 100100 chips in form of a 10×1010\times 10 square are given. These chips are rearranged such that any two adjacent (by side) chips are again adjacent, moreover no two chips are in the same cell. Prove that the chips are again in form of a square.