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 Fri, Jan 9, 2004 05:46 PM UTC:Excellent ★★★★★
Nice problem!. I have not a proof yet, but I think it is not possible a
solution with only one Pawn.
With two Pawns I have constructed this one:
QUEENS in  a1, b3, c5, d3, d8, e6, f4, g2, h5.
PAWNS in  c3, b5.