Check out Atomic Chess, our featured variant for November, 2024.


[ Help | Earliest Comments | Latest Comments ]
[ List All Subjects of Discussion | Create New Subject of Discussion ]
[ List Earliest Comments Only For Pages | Games | Rated Pages | Rated Games | Subjects of Discussion ]

Comments/Ratings for a Single Item

Earlier ⇧Reverse Order⇩ Later
The Eight Queens problem. Put eight queens on the board such that no one attacks another.[All Comments] [Add Comment or Rating]
Anonymous wrote on Sat, Dec 7, 2002 06:19 PM UTC:Excellent ★★★★★
Im only 10 years old.Please put some more information on the home page such as that their are only four and a half billion combinations to put the eight queens on the board but only ninty two combinations that the eight queens will not be attacking each other. Your website is not excellent your page is better than excellent.

Doug Chatham wrote on Sat, Jan 17, 2004 07:52 PM UTC:
Here's a long list of references on N-queens problems:<p> <a hhref='http://www.wi.leidenuniv.nl/~kosters/nqueens.html'> http://www.wi.leidenuniv.nl/~kosters/nqueens.html</a>

Doug Chatham wrote on Sun, Jan 18, 2004 07:12 PM UTC:
One more comment: there is a 2-player version of this puzzle. Players take turns placing Queens on an n x n chessboard such that no Queen is attacked. If a player has no more unattacked squares to put a Queen on, that player loses.<p> The game is called the Queen's Independence Game. See item 4 of <a href='http://www.cs.clemson.edu/~hedet/domination.html'> http://www.cs.clemson.edu/~hedet/domination.html</a> for more details.

3 comments displayed

Earlier ⇧Reverse Order⇩ Later

Permalink to the exact comments currently displayed.