8 Mutually Non-Attacking Queens 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 possible to arrange a maximum of $8$ queens so that no queen is attacking any other queen.
There are $12$ such arrangements, up to rotation and reflection.
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
- 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $8$
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $8$
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $12$
