ISL 2018 C2
Queenie and Horst play a game on a chessboard. In the beginning the board is empty. In every turn, Horst places a black knight on an empty square in such a way that his new knight does not attack any previous knights. Then Queenie places a white queen on an empty square. The game gets finished when somebody cannot move. Find the maximal positive such that, regardless of the strategy of Queenie, Horst can put at least knights on the board. (Armenia)
Dataset text NuminaMath olympiads. Quoted with source.
Official text: IMO 2018 Shortlist booklet, page 6.
Show the answer
100
Solutions
Official solution Solution 1 by the IMO Problem Selection Committee
The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).
Similar problems
These problems have the most words in common with this statement.