Free puzzles / Question / Moving Counter Problem
The Eccentric Cheesemonger.
The cheesemonger depicted in the illustration is an inveterate puzzle
lover. One of his favourite puzzles is the piling of cheeses in his
warehouse, an amusement that he finds good exercise for the body as well
as for the mind. He places sixteen cheeses on the floor in a straight
row and then makes them into four piles, with four cheeses in every
pile, by always passing a cheese over four others. If you use sixteen
counters and number them in order from 1 to 16, then you may place 1 on
6, 11 on 1, 7 on 4, and so on, until there are four in every pile. It
will be seen that it does not matter whether the four passed over are
standing alone or piled; they count just the same, and you can always
carry a cheese in either direction. There are a great many different
ways of doing it in twelve moves, so it makes a good game of "patience"
to try to solve it so that the four piles shall be left in different
stipulated places. For example, try to leave the piles at the extreme
ends of the row, on Nos. 1, 2, 15 and 16; this is quite easy. Then try
to leave three piles together, on Nos. 13, 14, and 15. Then again play
so that they shall be left on Nos. 3, 5, 12, and 14.
Answer
Make the following exchanges of pairs: H-K, H-E, H-C, H-A, I-L, I-F,
I-D, K-L, G-J, J-A, F-K, L-E, D-K, E-F, E-D, E-B, B-K. It will be found
that, although the white counters can be moved to their proper places in
11 moves, if we omit all consideration of exchanges, yet the black
cannot be so moved in fewer than 17 moves. So we have to introduce waste
moves with the white counters to equal the minimum required by the
black. Thus fewer than 17 moves must be impossible. Some of the moves
are, of course, interchangeable.