12 Knights to Attack or Occupy All Squares on Chessboard

Theorem

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

Proof

This theorem requires a proof. In particular: No doubt we will eventually progress to chess problems of various styles. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Sources

• 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $12$