[ 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: Thank you for explaining your mathematical excitement over the very interesting problem. I solved the problem in a matter of a minute or two. But I did not use math (at least not a a concious level). I had a strong hunch that a central pawn would be best to isolate 2 pawns on the rank, and then 2 on the file... I believed that the 'knight move' pattern optimized Queen placements for this problem... the Knight pattern is certainly abundant in the solution and I think that a mathematical solution should somehow incorporate the 'knight move' aspect of Queen placement. Best regards, Gary