TUYMAADA 2007 Problem 7
Several knights are arranged on an infinite chessboard. No square is attacked by more than one knight (in particular, a square occupied by a knight can be attacked by one knight but not by two). Sasha outlined a rectangle. What maximum number of knights can this rectangle contain?
Dataset text AI-MO AoPS. 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.