MathDB

There is a stone on each square of

n\times n

chessboard. We gather

n^2

stones and distribute them to the squares (again each square contains one stone) such that any two adjacent stones are again adjacent. Find all distributions such that at least one stone at the corners remains at its initial square. (Two squares are adjacent if they share a common edge.)

Problem Statement