This is rather a
difficult puzzle, though, as the
Hawkhurst hit on the solution, it is "just one of those puzzles that a
person might solve at a glance" by pure luck.
Yet when the solution,
its pretty, symmetrical arrangement, is seen, it looks ridiculously
It will be found
that Romeo reaches Juliet's
house once and only once, and making fourteen turnings, not counting
turn he makes at starting.
the fewest turnings possible, and
the problem can only be solved by the route shown or its reversal.