(related to Problem: An Episcopal Visitation)


In the diagram, I show how the bishop may be made to visit every one of his white parishes in seventeen moves. It is obvious that we must start from one corner square and end at the one that is diagonally opposite to it. The puzzle cannot be solved in fewer than seventeen moves.

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.