MathDB

(048) 5

Part of 1983 Tournament Of Towns

Problems(1)

TOT 048 1983 Autumn J5 N^2 pieces on NxN chessboard

Source:

8/18/2019
N2N^2 pieces are placed on an N×NN \times N chessboard. Is it possible to rearrange them in such a way that any two pieces which can capture each other (when considered to be knights) after the rearrangement are on adjacent squares (i.e. squares having at least one common boundary point)? Consider two cases: (a) N=3N = 3. (b) N=8N = 8
(S Stefanov)
combinatoricsChessboard