12 Knights to Attack or Occupy All Squares on Chessboard
Jump to navigation
Jump to search
This theorem requires a proof.
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.
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
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.
When this page/section has been completed, {{ProofWanted}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Sources
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $12$
