THE CANTERBURY PUZZLES
solution, with its pretty, symmetrical arrangement, is seen, it looks
ridiculously simple.
It will be found that Romeo reaches Juliet's balcony after visiting
every house once and only
once, and making fourteen
turnings, not counting the
turn he makes at starting.
These are the fewest turn-
ings possible, and the pro-
blem can only be solved by
the route shown or its re-
versal.
71.—
Romeo's Second
Journey.
In order to take his trip
through all the white squares only with the fewest possible turnings,
Romeo would do well to adopt the route I have shown, by means
of which only sixteen turn-
ings are required to perform
the feat. The Professor
informs me that the Helix
Aspersa, or common or gar-
den snail, has a peculiar
aversion to making turn-
ings : so much so, that one
specimen with which he
made experiments went off
in a straight line one night
and has never come back
since.
72.—
The Frogs Who Would a-Wooing Go.
This is one of those puzzles in which a plurality of solutions is
practically unavoidable. There are two or three positions into
172
