tion, always travelling either due south or due east. The puzzle is to discover which town is their destination.
Of course, if you find that there are more than 1,365 different routes to a town it cannot be the right one.
254.—THE MOTOR-CAR TOUR.
In the above diagram the circles represent towns and the lines good roads. In just how many different ways can a motorist, starting from London (marked with an L), make a tour of all these towns, visiting every town once, and only once, on a tour, and always coming back to London on the last ride? The exact reverse of any route is not counted as different.
255.—THE LEVEL PUZZLE.
This is a simple counting puzzle. In how many different ways can you spell out the word LEVEL by placing the point of your pencil on an L and then passing along the lines from
letter to letter. You may go in any direction, backwards or forwards. Of course you are not allowed to miss letters—that is to say, if you come to a letter you must use it.
256.—THE DIAMOND PUZZLE.
In how many different ways may the word DIAMOND be read in the arrangement shown? You may start wherever you like at a D and go up or down, backwards or forwards, in and out, in any direction you like, so long as you always pass from one letter to another that adjoins it. How many ways are there?
257.—THE DEIFIED PUZZLE.
In how many different ways may the word DEIFIED be read in this arrangement under
