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:00 AM UTC:

Gary, excuse it. I agree with your dissapointment. I were effusive because
I enjoyed the problem and the way I attacked the solution, trying to give
a proof to my wrong hypothesis of impossibility, it conduced me to find
the solution. Of course, I´m not the winner of the book, it was almost
clear in the Andreas mail that he found the solution, and he did it before
me; and now I know you did it days before. But I am more interested in the
mathematical problem than in the prize. I´m going to think in the general
problem, but it is a very difficult one, I conjecture that if N>=n
(certain n<=8), and if N<M<2N, it is possible to put M Queens and M-N Paws
on the board in such way the Queens are safe each other.