Problem

Source: Tuymaada 2007, Problem 7

Tags: geometry, rectangle, analytic geometry, combinatorics proposed, combinatorics



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 $ 14\times 16$ rectangle. What maximum number of knights can this rectangle contain?