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]
Roberto Lavieri wrote on Sat, Jan 10, 2004 02:08 AM UTC:
Conjecture:
It exists n ( n <= 8 ) such that, if N >= n, and if M is a number such
that N < M <= 2N, then it is possible to put M Queens and M-N Pawns on the
NxN board ia a manner that the Queens are safe each other