Problem

Source: III Caucasus Mathematical Olympiad

Tags: Chessboard, combinatorics



On a chessboard $8\times 8$, $n>6$ Knights are placed so that for any 6 Knights there are two Knights that attack each other. Find the greatest possible value of $n$.