The Puzzle Page is dedicated to bringing you the best puzzles collected from around the world along with original puzzles not seen anywhere else.

The staff at The Puzzle Page always enjoy seeing new puzzles and would love to hear from you. If you have a puzzle that's giving you problems, drop us a line -- we'd love to help.





Wednesday, June 23, 2010

The Mandarin's Puzzle

This puzzle comes from a collection of puzzles by the great Puzzlemaster, Henry Dudeney. This puzzle can be found as puzzle number 342 in his book, Amusements in Mathematics, published in 1917. You can still find copies of this book for sale. The puzzle is presented as it was published and any archaic or patronizing language may be atributed to Dudeney.  (Click on the picture for a larger view.)


"The following puzzle has an added interest from the circumstance that a correct solution of it secured for a certain young Chinaman the hand of his charming bride. The wealthiest mandarin within a radius of a hundred miles of Peking was Hi-Chum-Chop, and his beautiful daughter, Peeky-Bo, had innumerable admirers. One of her most ardent lovers was Winky-Hi, and when he asked the old mandarin for his consent to their marriage, Hi-Chum-Chop presented him with the following puzzle and promised his consent if the youth brought him the correct answer within a week. Winky-Hi, following ahabit which obtains among certain solvers to this day, gave it to all his friends, and when he had compared their solutions he handed in the best one as his own. Luckily it was quite right. The mandarin thereupon fulfilled his promise. The fatted pup was killed for the wedding feast, and when Hi-Chum-Chop passed Winky-Hi the liver wing all present knew that it was a token of eternal goodwill, in accordance with Chinese custom from time immemorial.
"The mandarin had a table divided into twenty-five squares, as shown in the diagram. On each of twenty-four of these squares was placed a number counter, just as I have indicated. The puzzle is to get the counters in numerical order by moving them one at a time in what we call “knight’s moves.” Counter 1 should be where 16 is, 2 where 11 is, 4 where 13 now is, and so on. It will be seen that all the counters on shaded squares are in their proper positions. Of course, two counters can never be on a square at the same time. Can you perform the feat in the fewest possible moves?
"In order to make the manner of moving perfectly clear I will point out that the first knight’s move can only be made by 1 or by 2 or by 10. Supposing 1 moves, then the next move must be by 23, 4, 8, or 21. As there is never more than on square vacant, the order in which the counters move may be written out as follows: 1—21—14—18—22, etc. A rough diagram should be made on a larger scale for practice, and numbered counters or pieces of cardboard used." - H. E. Dudeney
 
 

1 comment:

JohnMoore Micheel said...

Really a great supportive work.Puzzle page will really make students intelligent. This like academic related work will be a great support to reduce the students essay writing services work for schools.