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]
David Paulowich wrote on Tue, Nov 29, 2005 02:04 PM UTC:Excellent ★★★★★
[Reply to Andreas] I believe that 14 Archbishops is the maximum number that don't attack each other: 8 on the first rank and 6 more on the 8th rank (from b8 to g8). No idea how many Archbishops are needed to attack each square on the board.

Eight Chancellors placed on a long diagonal do not attack each other. Eight Rooks on: a1 c2 e3 g4 b5 d6 f7 h8 attack each EMPTY square on the board. Replacing these pieces with Chancellors covers all 64 squares.