12 Knights to Attack or Occupy All Squares on Chessboard

From ProofWiki
Jump to navigation Jump to search

Theorem

On a standard chessboard, a minimum of $12$ knights are needed to ensure all squares are either occupied or under attack.


Proof


Sources