All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Games
The Quaker Queens of Chess (Posted on 2003-06-03) Difficulty: 4 of 5
You have a standard chess board, and as many queens as you need. What is the most queens that you can put on the board so that no two queens can attack each other? What is the formation to put them in?

Keep in mind that a chess board has 64 squares (8x8), and queens can go diagonal, up and down, and left and right.

See The Solution Submitted by Jonathan Waltz    
Rating: 3.3333 (6 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution solution | Comment 1 of 9
Certainly no more than 8 queens can be so placed, as each must be in its own row and own column. That in fact 8 can be so placed is demonstrated in a classic programming exercise to find such placements.

There are 12 basically different ways to arrange the 8 queens. Except for one such arrangment, there are 7 other trivial variations: 3 rotations (90, 180 and 270 degrees), a reflection and the rotations of the reflection. There is one basic arrangement that has only one rotation (90 degrees) for itself and one for its reflection, so the total, counting reflections and rotations, is 92, which is 11 x 8 + 1 x 4.

I hope the following comes out ok using the html pre tag.

* . . . . . . . * . . . . . . . . . . . . * . .
. . . . . . * . . . . . . . * . * . . . . . . .
. . . . * . . . . . . * . . . . . . . . * . . .
. . . . . . . * . . . . . * . . . * . . . . . .
. * . . . . . . . . . . . . . * . . . . . . . *
. . . * . . . . . * . . . . . . . . * . . . . .
. . . . . * . . . . . . * . . . . . . . . . * .
. . * . . . . . . . * . . . . . . . . * . . . .
--------------- --------------- ---------------

. . . * . . . . . . . . * . . . . . * . . . . .
* . . . . . . . * . . . . . . . * . . . . . . .
. . . . * . . . . . . . . . . * . . . . . . * .
. . . . . . . * . . . * . . . . . . . . * . . .
. * . . . . . . . * . . . . . . . . . . . . . *
. . . . . . * . . . . . . . * . . * . . . . . .
. . * . . . . . . . * . . . . . . . . * . . . .
. . . . . * . . . . . . . * . . . . . . . * . .
--------------- --------------- ---------------

. . . . * . . . . . . . . . * . . . . . * . . .
* . . . . . . . * . . . . . . . * . . . . . . .
. . . * . . . . . . * . . . . . . . . . . . . *
. . . . . * . . . . . . . . . * . . . . . * . .
. . . . . . . * . . . . . * . . . . * . . . . .
. * . . . . . . . . . * . . . . . . . . . . * .
. . . . . . * . . * . . . . . . . * . . . . . .
. . * . . . . . . . . . * . . . . . . * . . . .
--------------- --------------- ---------------

. . . . * . . . . . . . * . . . . . . . . * . .
. . * . . . . . . . . . . . * . . . * . . . . .
* . . . . . . . * . . . . . . . * . . . . . . .
. . . . . . * . . . . * . . . . . . . . . . . *
. * . . . . . . . * . . . . . . . . . * . . . .
. . . . . . . * . . . . . . . * . * . . . . . .
. . . . . * . . . . . . . * . . . . . . . . * .
. . . * . . . . . . * . . . . . . . . . * . . .
--------------- --------------- ---------------


  Posted by Charlie on 2003-06-03 08:20:48
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (9)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information