Free puzzles / Question / The Guarded Chessboard
Exercise For Prisoners.
The following is the plan of the north wing of a certain gaol, showing
the sixteen cells all communicating by open doorways. Fifteen prisoners
were numbered and arranged in the cells as shown. They were allowed to
change their cells as much as they liked, but if two prisoners were ever
in the same cell together there was a severe punishment promised them.
Now, in order to reduce their growing obesity, and to combine physical
exercise with mental recreation, the prisoners decided, on the
suggestion of one of their number who was interested in knight's tours,
to try to form themselves into a perfect knight's path without breaking
the prison regulations, and leaving the bottom right-hand corner cell
vacant, as originally. The joke of the matter is that the arrangement at
which they arrived was as follows:--
8 3 12 1
11 14 9 6
4 7 2 13
15 10 5
The warders failed to detect the important fact that the men could not
possibly get into this position without two of them having been at some
time in the same cell together. Make the attempt with counters on a
ruled diagram, and you will find that this is so. Otherwise the solution
is correct enough, each member being, as required, a knight's move from
the preceding number, and the original corner cell vacant.
The puzzle is to start with the men placed as in the illustration and
show how it might have been done in the fewest moves, while giving a
complete rest to as many prisoners as possible.
As there is never more than one vacant cell for a man to enter, it is
only necessary to write down the numbers of the men in the order in
which they move. It is clear that very few men can be left throughout in
their cells undisturbed, but I will leave the solver to discover just
how many, as this is a very essential part of the puzzle.
Answer
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.
+-----+------+------+------+------+
|1 |2 |3 |4 |5 |
| | | | | |
| 1 | 18 | 9 | 14 | 5 |
| | | | | |
+-----+------+------+------+------+
|6 |7 |8 |9 |10 |
| | | | | |
| 8 | 13 | 4 | 19 | 10 |
| | | | | |
+-----+------+------+------+------+
|11 |12 |13 |14 |15 |
| | | | | |
| 17 | 2 | 11 | 6 | 15 |
| | | | | |
+-----+------+------+------+------+
|16 |17 |18 |19 |20 |
| | | | | |
| 12 | 7 | 16 | 3 | 20 |
| | | | | |
+-----+------+------+------+------+
|21 |22 |23 |24 |25 |
| | | | | |
| | | | | |
| | | | | |
+-----+------+------+------+------+
This position may be arrived at in as few as forty-six moves, as
follows: 16--21, 16--22, 16--23, 17--16, 12--17, 12--22, 12--21,7--12,
7--17, 7--22, 11--12, 11--17, 2--7, 2--12, 6--11, 8--7, 8--6, 13--8,
18--13, 11--18, 2--17, 18--12, 18--7, 18--2, 13--7, 3--8, 3--13, 4--3,
4--8, 9--4, 9--3, 14--9, 14--4, 19--14, 19--9, 3--14, 3--19, 6--12,
6--13, 6--14, 17--11, 12--16, 2--12, 7--17, 11--13, 16--18 = 46 moves. I
am, of course, not able to say positively that a solution cannot be
discovered in fewer moves, but I believe it will be found a very hard
task to reduce the number.