Free puzzles / Question / Magic Squares Problem.
The Magic Strips.
I happened to have lying on my table a number of strips of cardboard,
with numbers printed on them from 1 upwards in numerical order. The idea
suddenly came to me, as ideas have a way of unexpectedly coming, to make
a little puzzle of this. I wonder whether many readers will arrive at
the same solution that I did.
Take seven strips of cardboard and lay them together as above. Then
write on each of them the numbers 1, 2, 3, 4, 5, 6, 7, as shown, so that
the numbers shall form seven rows and seven columns.
Now, the puzzle is to cut these strips into the fewest possible pieces
so that they may be placed together and form a magic square, the seven
rows, seven columns, and two diagonals adding up the same number. No
figures may be turned upside down or placed on their sides--that is, all
the strips must lie in their original direction.
Of course you could cut each strip into seven separate pieces, each
piece containing a number, and the puzzle would then be very easy, but I
need hardly say that forty-nine pieces is a long way from being the
fewest possible.
Answer
There are eight ways of forming the magic square--all merely different
aspects of one fundamental arrangement. Thus, if you give our first
square a quarter turn you will get the second square; and as the four
sides may be in turn brought to the top, there are four aspects. These
four in turn reflected in a mirror produce the remaining four aspects.
Now, of these eight arrangements only four can possibly be reached under
the conditions, and only two of these four can be reached in the fewest
possible moves, which is nineteen. These two arrangements are shown.
Move the men in the following order: 5, 3, 2, 5, 7, 6, 4, 1, 5, 7, 6, 4,
1, 6, 4, 8, 3, 2, 7, and you get the first square. Move them thus: 4, 1,
2, 4, 1, 6, 7, 1, 5, 8, 1, 5, 6, 7, 5, 6, 4, 2, 7, and you have the
arrangement in the second square. In the first case every man has moved,
but in the second case the man numbered 3 has never left his cell.
Therefore No. 3 must be the obstinate prisoner, and the second square
must be the required arrangement.
[Illustration:
+---+---+---+ +---+---+---+
| | | | | | | |
| 5 7 | | 7 4 3 |
| | | | | | | |
+- -+- -+- -+ +- -+- -+- -+
| | | | | | | |
| 6 4 2 | | 4 8 |
| | | | | | | |
+- -+- -+- -+ +- -+- -+- -+
| | | | | | | |
| 1 8 3 | | 5 6 1 |
| | | | | | | |
+---+---+---+ +---+---+---+
]