The statement of the problem is simple. Place 14 knights on the board in such a way that it meets 2 qualifications.
1 All squares where a knight is not have a knight attacking/defending them.
2 No square with a knight is attacked or defended by a fellow knight.
3 Presumably, no square has more than 1 knight..
I note one thing in particular. There is nothing prohibiting 2 or more knights from attacking/defending the same square, only each other. And that is probably key.