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


The Contest Center welcomes contributions of your original puzzles, riddles and jokes, including anagrams, cryptograms, plus math-themed art and animations. Share your creations with other puzzle-lovers.

All submissions must be your own original work. Do not submit material that is copyrighted elsewhere. Do not submit material that you found in books, magazines, TV shows, movies, podcasts, or on other websites.

Send submissions to Contest Center Submissions
Submit puzzle answers to Contest Center Answers
Send questions and correspondence to Contest Center Mail

Quick Links
HOME SITE MAP


© Copyright 2025 The Contest Center