MathDB
min change of colours in hamiltonian path of king

Source: KoMaL A. 881

June 11, 2024
komalcombinatoricsChessboardchess king

Problem Statement

We visit all squares exactly once on a n×nn\times n chessboard (colored in the usual way) with a king. Find the smallest number of times we had to switch colors during our walk.
Proposed by Dömötör Pálvölgyi, Budapest