12 Knights to Attack or Occupy All Squares on Chessboard

From ProofWiki
Jump to: navigation, search

Theorem

On a standard chessboard, it is a maximum of $12$ knights are needed to ensure all squares are either occipied or under attack.


Proof


Sources