Question 85
Let $n$ be a positive integer. Find the largest number of knights that can be placed on a board of size $n \times n$ in such a way that no two knights attack each other. A knight attacks precisely the squares that are located either horizontally by one square and vertically by two squares away or horizontally by two squares and vertically by one square away.
