[ 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] Tez wrote on 2009-09-05 UTCReply to Andreas: As for the second archbishop problem (attacking every square), I have found a solution with just eight archbishops. Archbishops on a1, b3, c5, d7, e7, f5, g3 and h1 cover all squares. I believe it is optimal, but I do not know for certain.