8 Mutually Non-Attacking Queens on Chessboard

From ProofWiki
Jump to: navigation, search

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


Sources