KöMaL 2024 A881
We visit all squares exactly once on a chessboard (colored in the usual way) with a king. Find the smallest number of times we had to switch colors during our walk.
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.