Free puzzles / Question / The Guarded Chessboard
The Mandarin's Puzzle.
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 a habit 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
numbered 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
may 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 one 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.
Answer
There are eighty different arrangements of the numbers in the form of a
perfect knight's path, but only forty of these can be reached without
two men ever being in a cell at the same time. Two is the greatest
number of men that can be given a complete rest, and though the knight's
path can be arranged so as to leave either 7 and 13, 8 and 13, 5 and 7,
or 5 and 13 in their original positions, the following four
arrangements, in which 7 and 13 are unmoved, are the only ones that can
be reached under the moving conditions. It therefore resolves itself
into finding the fewest possible moves that will lead up to one of these
positions. This is certainly no easy matter, and no rigid rules can be
laid down for arriving at the correct answer. It is largely a matter for
individual judgment, patient experiment, and a sharp eye for revolutions
and position.
A
+--+--+--+--+
| 6| 1|10|15|
+--+--+--+--+
| 9|12| 7| 4|
+--+--+--+--+
| 2| 5|14|11|
+--+--+--+--+
|13| 8| 3||
+--+--+--+--+
B
+--+--+--+--+
| 6| 1|10|15|
+--+--+--+--+
|11|14| 7| 4|
+--+--+--+--+
| 2| 5|12| 9|
+--+--+--+--+
|13| 8| 3||
+--+--+--+--+
C
+--+--+--+--+
| 6| 9| 4|15|
+--+--+--+--+
| 1|12| 7|10|
+--+--+--+--+
| 8| 5|14| 3|
+--+--+--+--+
|13| 2|11||
+--+--+--+--+
D
+--+--+--+--+
| 6|11| 4|15|
+--+--+--+--+
| 1|14| 7|10|
+--+--+--+--+
| 8| 5|12| 3|
+--+--+--+--+
|13| 2| 9||
+--+--+--+--+
[Illustration: A, B, C, D]
As a matter of fact, the position C can be reached in as few as
sixty-six moves in the following manner: 12, 11, 15, 12, 11, 8, 4, 3, 2,
6, 5, 1, 6, 5, 10, 15, 8, 4, 3, 2, 5, 10, 15, 8, 4, 3, 2, 5, 10, 15, 8,
4, 12, 11, 3, 2, 5, 10, 15, 6, 1, 8, 4, 9, 8, 1, 6, 4, 9, 12, 2, 5, 10,
15, 4, 9, 12, 2, 5, 3, 11, 14, 2, 5, 14, 11 = 66 moves. Though this is
the shortest that I know of, and I do not think it can be beaten, I
cannot state positively that there is not a shorter way yet to be
discovered. The most tempting arrangement is certainly A; but things
are not what they seem, and C is really the easiest to reach.
If the bottom left-hand corner cell might be left vacant, the following
is a solution in forty-five moves by Mr. R. Elrick: 15, 11, 10, 9, 13,
14, 11, 10, 7, 8, 4, 3, 8, 6, 9, 7, 12, 4, 6, 9, 5, 13, 7, 5, 13, 1, 2,
13, 5, 7, 1, 2, 13, 8, 3, 6, 9, 12, 7, 11, 14, 1, 11, 14, 1. But every
man has moved.