Check out Janggi (Korean Chess), our featured variant for December, 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 ]

Single Comment

Contest: the 9 Queens Problem. Put 9 queens and 1 or 2 pawns such that queens do not see each other. Send your solution before Feb 29, and win a book![All Comments] [Add Comment or Rating]
Doug Chatham wrote on Sat, Feb 12, 2005 04:28 PM UTC:
GEOFX_BBFC,<br> <p>It looks like the last part of your list was cut off. Your list has only 98 solutions, but there are 128 solutions to the '9 Queens Problem' <p>You may find the following PDF files interesting:<ul><li><a href='http://people.moreheadstate.edu/fs/d.chatham/N+1QP.pdf'>The N+1 Queens Problem</a></li><li><a href='http://people.moreheadstate.edu/fs/d.chatham/queenssep.pdf'>The Queens Separation Problem</a></ul>