[ Help | Earliest Comments | Latest Comments ][ List All Subjects of Discussion | Create New Subject of Discussion ][ List Latest Comments Only For Pages | Games | Rated Pages | Rated Games | Subjects of Discussion ]Comments/Ratings for a Single Item Later ⇩Reverse Order⇧ Earlier The Eight Queens problem. Put eight queens on the board such that no one attacks another.[All Comments] [Add Comment or Rating]Doug Chatham wrote on 2004-01-18 UTCOne 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. Doug Chatham wrote on 2004-01-17 UTCHere'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> Anonymous wrote on 2002-12-07 UTCExcellent ★★★★★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. 3 comments displayedLater ⇩Reverse Order⇧ EarlierPermalink to the exact comments currently displayed.