(related to Problem: The Diamond Puzzle)

There are $252$ different ways. The general formula is that, for words of n letters (not palindromes, as in the case of the next puzzle), when grouped in this manner, there are always $2^{(n+1)} - 4$ different readings. This does not allow diagonal readings, such as you would get if you used instead such a word as $DIGGING,$ where it would be possible to pass from one $G$ to another $G$ by a diagonal step.

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.