The 12x12 Queens Problem

A classic puzzle is to arrange 5 differently colored sets of 5 queens on a 5×5 board so that no two queens of the same color attack each other. For 8 sets of 8 queens on an 8×8 board, the problem has no solution. How about 12 sets of 12? George Pólya showed that a doubly periodic solution for the -queens problem exists if and only if . For years, due to this result, it was assumed that was unsolvable. Patrick Hamlyn and Guenter Stertenbrink tackled it anyway, using a clique-search program in the graph of all 14200 12-queen solutions. It turns out there are 178 solutions, displayed here.

(Over 500 lines omitted)

Reference:
Ed Pegg Jr, Chessboard Tasks, MAA Online, 2005.
comments
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+