Consider h+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? geometryperimetercombinatorics unsolvedcombinatorics