Copyright © University of Cambridge. All rights reserved.

## 'Eight Queens' printed from http://nrich.maths.org/

This is a famous problem: Place eight queens on a chessboard (an
$8$ by $8$ grid) so that none can capture any of the others.

Remember that a queen can move any number of squares across,
down or diagonally.

This is a good one to do outside with seven friends standing on
an $8$ by $8$ grid!

Is there more than one solution?