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]
Andreas Kaufmann wrote on Fri, Jan 9, 2004 11:14 PM UTC:Excellent ★★★★★
Roberto, the solution for ten queens and two pawns is very elegant! I
failed to find it, also I easily found the soultion for nine queens and a
pawn. 
 
How about general problem? Namely, given board of size NxN, M queens (M>N)
find the minumum number of pawns, so that it is possible to setup queens
and pawns in such a way that queens don't attack each other. Looks like a
quite difficult mathematical problem.