KöMaL 2026 K889
In chess, the queen can move any number of squares in a straight line or diagonally. Find the smallest number of queens that can be placed on a chessboard such that any square not occupied by a queen can be reached by one of the queens.
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.