Stories Poetry.com - Download the EBook StoriesInformational Site Network Informational
Privacy
Home Top Rated Puzzles Most Viewed Puzzles All Puzzle Questions Random Puzzle Question Search


The Monk's Puzzle

(CANTERBURY PUZZLES)

The Monk that went with the party was a great lover of sport. "Greyhounds he had as swift as fowl of flight: Of riding and of hunting for the hare Was all his love, for no cost would he spare." One day he addressed the pilgrims as follows:—



"There is a little matter that hath at times perplexed me greatly, though certes it is of no great weight; yet may it serve to try the wits of some that be cunning in such things. Nine kennels have I for the use of my dogs, and they be put in the form of a square; though the one in the middle I do never use, it not being of a useful nature. Now the riddle is to find in how many different ways I may place my dogs in all or any of the outside kennels so that the number of dogs on every side of the square may be just ten." The small diagrams show four ways of doing it, and though the fourth way is merely a reversal of the third, it counts as different. Any kennels may be left empty. This puzzle was evidently a variation of the ancient one of the Abbess and her Nuns.










Answer:


The Monk might have placed dogs in the kennels in two thousand nine hundred and twenty-six different ways, so that there should be ten dogs on every side. The number of dogs might vary from twenty to forty, and as long as the Monk kept his animals within these limits the thing was always possible.



The general solution to this puzzle is difficult. I find that for n dogs on every side of the square, the number of different ways is (n4 + 10n3 + 38n2 + 62n + 33) / 48, where n is odd, and ((n4 + 10n3 + 38n2 + 68n) / 48) + 1, where n is even, if we count only those arrangements that are fundamentally different. But if we count all reversals and reflections as different, as the Monk himself did, then n dogs (odd or even) may be placed in ((n4 + 6n3 + 14n2 + 15n) / 6) + 1 ways. In order that there may be n dogs on every side, the number must not be less than 2n nor greater than 4n, but it may be any number within these limits.



An extension of the principle involved in this puzzle is given in No. 42, "The Riddle of the Pilgrims." See also "The Eight Villas" and "A Dormitory Puzzle" in A. in M.















Random Questions

The Twelve Pennies.
Moving Counter Problem
The Board In Compartments.
The Guarded Chessboard
The Cook's Puzzle
CANTERBURY PUZZLES
Romeo And Juliet
THE PROFESSOR'S PUZZLES
The Four Sevens.
Money Puzzles
An Easy Square Puzzle.
Various Dissection Puzzles
The Three Teacups
THE SQUIRE'S CHRISTMAS PUZZLE PARTY
Mr. Gubbins In A Fog.
Money Puzzles
Chinese Money.
Money Puzzles
How To Draw An Oval.
Patchwork Puzzles
The Sabbath Puzzle.
Unclassified Problems.
The Queen's Journey.
The Guarded Chessboard
The Lion And The Man.
The Guarded Chessboard
The Amulet
PUZZLING TIMES AT SOLVAMHALL CASTLE
Nine Jolly Gaol Birds.
Magic Squares Problem.