Library / /32 of 151

, 2024

Combinatorics Difficulty 6.0 National Olympiad Find the answer Hungary

We visit all squares exactly once on a $n\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.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.