The maximal number of knights on a square chessboard such that each knight attacks exactly two others – math.stackexchange.com
SirMrprofmol
What is the maximal number of knights on a square chessboard which can be placed in such a way that every knight attacks exactly two others?
We name $f(n)$ that maximal number of them on a $n \times ...