8 Mutually Non-Attacking Rooks on Chessboard

Theorem

On a standard chessboard, it is possible to arrange a maximum of $8$ rooks so that no rook is attacking any other rook.

There are $5282$ such arrangements, up to rotation and reflection.


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): $5282$
This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.