by Dudeney, Henry Ernest, 1857-1930
Available in 215 free installments
Owner:
In Diagram D I give another familiar puzzle that first appeared in a book published in Brussels in 1789, Les Petites Aventures de Jerome Sharp. Place seven counters on seven of the eight points in the following manner. You must always touch a point that is vacant with a counter, and then move it along a straight line leading from that point to the next vacant point (in either direction), where you deposit the counter, ^u proceed in the same way until all the counters are placed. Remember you always touch a vacant place and slide the counter from it to the next place, which must be also vacant. Now, by the "buttons and string" method of simplification we can transform the diagram into E. Then the solution becomes obvious. "Always move to the point that you last moved from." This is not, of course, the only way of placing the counters, but it is the simplest solution to carry in the mind.
There are several puzzles in this book that the reader will find lend themselves readily to this method.
342.?THE MANDARIN'S PUZZLE.? solution
The rather perplexing point that the solver has to decide for himself in attacking this puzzle is whether the shaded numbers (those that are shown in their right places) are mere dummies or not. Ninety-nine persons out of a hundred might form the opinion that there can be no advantage in moving any of them, but if so they would be wrong.
The shortest solution without moving any shaded number is in thirty-two moves. But the puzzle can be solved in thirty moves. The trick lies in moving the 6, or the 15, on the second move and replacing it on the nineteenth move. Here is the solution: 2, 6, 13,4, 1,21,4, 1, 10,2,21, 10,2,5,22, 16, 1, 13,6, 19, 11,2,5,22, 16,5, 13,4,10, 21. Thirty moves.
343.?EXERCISE FOR PRISONERS.? solution
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.
Pg231
- 4- 4- 4" ?
9,12r,V
2,5 1111
B
k 1 + 12 + r + 10 -8,5,14.3,
? -f~ """7 "T^-.-'T
13, 2,. 11 i\ '
g'i'io'is
r>
6 ll 4* ,15
- 4~ + 4? ?
1 14? ,10 ,8 ,5,1 23
? -t- -h -r- t
J ^i ^i 3 r. -i
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.
344.?THE KENNEL PUZZLE.? solution
The first point is to make a choice of the most promising knight's string and then consider the question of reaching the arrangement in the fewest moves. I am strongly of opinion that the best string is the one represented in the following diagram, in which it will be seen that each successive number is a knight's move from the preceding one, and that five of the dogs (1, 5,10,15, and 20) never leave their original kennels.
'®f®f®r@r©
® © © ® ®
TT* H^ 4 *~h* ?fa* Ht^ ?
®!®T®f®I@
21
"? *-
XL
J I 1_1
