(related to Problem: The Chinese Chessboard)

Eighteen is the maximum number of pieces. I give two solutions. The numbered diagram is so cut that the eighteenth piece has the largest area — eight squares — that is possible under the conditions. The second diagram was prepared under the added condition that no piece should contain more than five squares.


No. $74$ in the Canterbury Puzzles shows how to cut the board into twelve pieces, all different, each containing five squares, with one square piece of four squares.

Thank you to the contributors under CC BY-SA 4.0!



Project Gutenberg

  1. Dudeney, H. E.: "Amusements in Mathematics", The Authors' Club, 1917

This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this edition or online at If you are not located in the United States, you'll have to check the laws of the country where you are located before using this ebook.