SOLUTIONS
order :—CYASNPTREIRMBLUIRG, which is the required
arrangement for the cards, C being at the top of the pack and G
at the bottom.
12.—
The Merchant's Puzzle.
This puzzle amounts to finding the smallest possible number that
has exactly sixty-four divisors, counting 1 and the number itself as
divisors. The least number is 7,560. The pilgrims might,
therefore, have ridden in single file, two and two, three and three,
four and four, and so on, in exactly sixty-four different ways, the
last manner being in a single row of 7,560.
The Merchant was careful to say that they were going over
a common, and not to mention its size, for it certainly would not be
possible along an ordinary road !
13.—
The Man of Law's Puzzle.
The fewest possible moves for getting the prisoners into their
dungeons in the required numerical order are twenty-six. The
men move in the following order :—1, 2, 3, 1,2, 6, 5, 3, 1, 2, 6, 5,
3, 1,2, 4, 8, 7, 1, 2, 4, 8, 7, 4, 5, 6. As there is never more
than one vacant dungeon to be moved into, there can be no ambiguity
in the notation.
14.—
The Weavers Puzzle.
The illustration shows clearly how the
Weaver cut his square of beautiful cloth
into four pieces of exactly the same size
and shape, so that each piece con-
tained an embroidered lion and castle
unmutilated in any way.
15.—
The Cook's Puzzle.
There were four portions of warden pie and four portions of
venison pasty to be distributed among eight out of eleven guests.
137
