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 ]

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 Mon, Nov 28, 2005 12:04 PM UTC:

For each k>=0, if N is large enough, it is possible to place N+k queens and k pawns on an N x N chessboard so that no queens attack each other. See http://home.earthlink.net/~drrdchat/N+kqueens.pdf and http://home.earthlink.net/~drrdchat/N+khandout.pdf for more details.