Amusements in Mathematics by Henry Ernest Dudeney (best free ebook reader for pc .txt) ๐
11.--THE CYCLISTS' FEAST.
'Twas last Bank Holiday, so I've been told,Some cyclists rode abroad in glorious weather.Resting at noon within a tavern old,They all agreed to have a feast together."Put it all in one bill, mine host," they said,"For every man an equal share will pay."The bill was promptly on the table laid,And four pounds was the reckoning that day.But, sad to state, when they prepared to square,'Twas found that two had sneaked outside and fled.So, for two shillings more than his due shareEach honest man who had remained was bled.They settled later with those rogues, no doubt.
Read free book ยซAmusements in Mathematics by Henry Ernest Dudeney (best free ebook reader for pc .txt) ๐ยป - read online or download for free at americanlibrarybooks.com
- Author: Henry Ernest Dudeney
- Performer: 0486204731
Read book online ยซAmusements in Mathematics by Henry Ernest Dudeney (best free ebook reader for pc .txt) ๐ยป. Author - Henry Ernest Dudeney
We will now pass to the interesting subject of how to thread any maze. While being necessarily brief, I will try to make the matter clear to readers who have no knowledge of mathematics. And first of all we will assume that we are trying to enter a maze (that is, get to the "centre") of which we have no plan and about which we know nothing. The first rule is this: If a maze has no parts of its hedges detached from the rest, then if we always keep in touch with the hedge with the right hand (or always touch it with the left), going down to the stop in every blind alley and coming back on the other side, we shall pass through every part of the maze and make our exit where we went in. Therefore we must at one time or another enter the centre, and every alley will be traversed twice.
Now look at the Hampton Court plan. Follow, say to the right, the path indicated by the dotted line, and what I have said is clearly correct if we obliterate the two detached parts, or "islands," situated on each side of the star. But as these islands are there, you cannot by this method traverse every part of the maze; and if it had been so planned that the "centre" was, like the star, between the two islands, you would never pass through the "centre" at all. A glance at the Hatfield maze will show that there are three of these detached hedges or islands at the centre, so this method will never take you to the "centre" of that one. But the rule will at least always bring you safely out again unless you blunder in the following way. Suppose, when you were going in the direction of the arrow in the Hampton Court Maze, that you could not distinctly see the turning at the bottom, that you imagined you were in a blind alley and, to save time, crossed at once to the opposite hedge, then you would go round and round that U-shaped island with your right hand still always on the hedgeโfor ever after!
This blunder happened to me a few years ago in a little maze on the isle of Caldy, South Wales. I knew the maze was a small one, but after a very long walk I was amazed to find that I did not either reach the "centre" or get out again. So I threw a piece of paper on the ground, and soon came round to it; from which I knew that I had blundered over a supposed blind alley and was going round and round an island. Crossing to the opposite hedge and using more care, I was quickly at the centre and out again. Now, if I had made a similar mistake at Hampton Court, and discovered the error when at the star, I should merely have passed from one island to another! And if I had again discovered that I was on a detached part, I might with ill luck have recrossed to the first island again! We thus see that this "touching the hedge" method should always bring us safely out of a maze that we have entered; it may happen to take us through the "centre," and if we miss the centre we shall know there must be islands. But it has to be done with a little care, and in no case can we be sure that we have traversed every alley or that there are no detached parts.
If the maze has many islands, the traversing of the whole of it may be a matter of considerable difficulty. Here is a method for solving any maze, due to M. Trรฉmaux, but it necessitates carefully marking in some way your entrances and exits where the galleries fork. I give a diagram of an imaginary maze of a very simple character that will serve our purpose just as well as something more complex (Fig. 20). The circles at the regions where we have a choice of turnings we may call nodes. A "new" path or node is one that has not been entered before on the route; an "old" path or node is one that has already been entered, 1. No path may be traversed more than twice. 2. When you come to a new node, take any path you like. 3. When by a new path you come to an old node or to the stop of a blind alley, return by the path you came. 4. When by an old path you come to an old node, take a new path if there is one; if not, an old path. The route indicated by the dotted line in the diagram is taken in accordance with these simple rules, and it will be seen that it leads us to the centre, although the maze consists of four islands.
Neither of the methods I have given will disclose to us the shortest way to the centre, nor the number of the different routes. But we can easily settle these points with a plan. Let us take the Hatfield maze (Fig. 21). It will be seen that I have suppressed all the blind alleys by the shading. I begin at the stop and work backwards until the path forks. These shaded parts, therefore, can never be entered without our having to retrace our steps. Then it is very clearly seen that if we enter at A we must come out at B; if we enter at C we must come out at D. Then we have merely to determine whether A, B, E, or C, D, E, is the shorter route. As a matter of fact, it will be found by rough measurement or calculation that the shortest route to the centre is by way of C, D, E, F.
I will now give three mazes that are simply puzzles on paper, for, so far as I know, they have never been constructed in any other way. The first I will call the Philadelphia maze (Fig. 22). Fourteen years ago a travelling salesman, living in Philadelphia, U.S.A., developed a curiously unrestrained passion for puzzles. He neglected his business, and soon his position was taken from him. His days and nights were now passed with the subject that fascinated him, and this little maze seems to have driven him into insanity. He had been puzzling over it for some time, and finally it sent him mad and caused him to fire a bullet through his brain. Goodness knows what his difficulties could have been! But there can be little doubt that he had a disordered mind, and that if this little puzzle had not caused him to lose his mental balance some other more or less trivial thing would in time have done so. There is no moral in the story, unless it be that of the Irish maxim, which applies to every occupation of life as much as to the solving of puzzles: "Take things aisy; if you can't take them aisy, take them as aisy as you can." And it is a bad and empirical way of solving any puzzleโby blowing your brains out.
Now, how many different routes are there from A to B in this maze if we must never in any route go along the same passage twice? The four open spaces where four passages end are not reckoned as "passages." In the diagram (Fig. 22) it will be seen that I have again suppressed the blind alleys. It will be found that, in any case, we must go from A to C, and also from F to B. But when we have arrived at C there are three ways, marked 1, 2, 3, of getting to D. Similarly, when we get to E there are three ways, marked 4, 5, 6, of getting to F. We have also the dotted route from C to E, the other dotted route from D to F, and the passage from D to E, indicated by stars. We can, therefore, express the position of affairs by the little diagram annexed (Fig. 23). Here every condition of route exactly corresponds to that in the circular maze, only it is much less confusing to the eye. Now, the number of routes, under the conditions, from A to B on this simplified diagram is 640, and that is the required answer to the maze puzzle.
Finally, I will leave two easy maze puzzles (Figs. 24, 25) for my readers to solve for themselves. The puzzle in each case is to find the shortest possible route to the centre. Everybody knows the story of Fair Rosamund and the Woodstock maze. What the maze was like or whether it ever existed except in imagination is not known, many writers believing that it was simply a badly-constructed house with a large number of confusing rooms and passages. At any rate, my sketch lacks the authority of the other mazes in this article. My "Rosamund's Bower" is simply designed to show that where you have the plan before you it often happens that the easiest way to find a route into a maze is by working backwards and first finding a way out.
"Is not life itself a paradox?"
C.L. DODGSON, Pillow Problems.
"It is a wonderful age!" said Mr. Allgood, and everybody at the table turned towards him and assumed an attitude of expectancy.
This was an ordinary Christmas dinner of the Allgood family, with a sprinkling of local friends. Nobody would have supposed that the above remark would lead, as it did, to a succession of curious puzzles and paradoxes, to which every member of the party contributed
Comments (0)