BISHOP COVERINGS
FOR MxN CHESSBOARDS
Frank Rubin

       The problem of how to cover a chessboard with the smallest number of 2-color bishops is presented in a forthcoming article in the Journal of Recreational Mathematics. Solutions are shown in the article for all square boards, and rectangular boards of sizes 2xN, 3xN, 4xN and 5xN.
       Unfortunately, the solutions for these boards are too large to be legible in the journal. However, webpages can hold enough text to make the 6xN, 7xN and 8xN solutions legible. (If the lines are too wide in your browser, you can select a smaller type size.) The following links can be used to see these solutions.

6xN Solutions 7xN Solutions 8xN Solutions

       Some solutions for larger boards have been obtained, but the full cycles for these boards are still unknown.

You might also enjoy the Contest Center's
Chess Puzzles webpage
Knight Coverings webpage
Mathematical Puzzles webpages
Puzzles and Games webpages
Crosswords webpages
Software

Send us an email for any comments about chess coverings. Be sure to change the $ to an @ in our email address.

Quick Links

Interactive Online Games
<<< PREV	HOME	MAP	NEXT >>>

© Copyright 2005-2011 The Contest Center