MathDB

A. 881

Part of KoMaL A Problems 2023/2024

Problems(1)

min change of colours in hamiltonian path of king

Source: KoMaL A. 881

6/11/2024
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
komalcombinatoricsChessboardchess king