I’ve seen the solutions to the lowest amount of queens, bishops, and rooks are needed to cover an entire board, as in they can attack all squares and are the only type of piece on the board. What is the solution for this with knights?
Depending on whether occupied squares need to be covered as well, the number is:
- 12 knights (without covering occupied squares)
- 14 knights (with covering occupied squares)
Problems like this are called domination problems and solutions for knights and other pieces as well as a reference are given on the wikipedia page on mathematical chess problems