70.--_Romeo and Juliet._

This is rather a difficult puzzle, though, as the Professor remarked when

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, 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 turnings possible, and

the problem can only be solved by the route shown or its reversal.

[Illustration]

The Canterbury Puzzles, and Other Curious Problems · 第 235 / 286 题