MathDB
Collection are brought into coincidence

Source: IMO LongList 1988, Spain 3, Problem 72 of ILL

November 9, 2005
geometryperimetercombinatorics unsolvedcombinatorics

Problem Statement

Consider h+1h+1 chess boards. Number the squares of each board from 1 to 64 in such a way that when the perimeters of any two boards of the collection are brought into coincidence in any possible manner, no two squares in the same position have the same number. What is the maximum value of h?h?