5 6 1 7 4 2 4 5 6 8 3 5 1 6 8 3 4 5 6 7 3 4 1 7 8 1 4 7 6 8 2 5 1 7 8 2 3 7 6 8 2 5 3 6 8 2 4 7 5 8 1 5 3 7 8 3 4 9 5 6 2 4 3 7 8 2 4 9 5 7 1 4 5 7 8 1 4 9 6 7 2 3 5 7 8 2 3 9 6 7
It will be noticed that there must always be an odd number in the centre, that there are four ways each of adding up 23, 25, and 27, but only three ways each of summing to 24 and 26.
383.—THE "T" CARD PUZZLE.
If we remove the ace, the remaining cards may he divided into two groups (each adding up alike) in four ways; if we remove 3, there are three ways; if 5, there are four ways; if 7, there are three ways; and if we remove 9, there are four ways of making two equal groups. There are thus eighteen different ways of grouping, and if we take any one of these and keep the odd card (that I have called "removed") at the head of the column, then one set of numbers can be varied in order in twenty-four ways in the column and the other four twenty-four ways in the horizontal, or together they may be varied in 24 x 24 = 576 ways. And as there are eighteen such cases, we multiply this number by 18 and get 10,368, the correct number of ways of placing the cards. As this number includes the reflections, we must divide by 2, but we have also to remember that every horizontal row can change places with a vertical row, necessitating our multiplying by 2; so one operation cancels the other.
The following arrangements of the cards show (1) the smallest possible sum, 17; and (2) the largest possible, 23.
1 7 9 6 4 2 4 8 3 6 3 7 5 2 9 5 1 8
It will be seen that the two cards in the middle of any side may always be interchanged without affecting the conditions. Thus there are eight ways of presenting every fundamental arrangement. The number of fundamentals is eighteen, as follows: two summing to 17, four summing to 19, six summing to 20, four summing to 21, and two summing to 23. These eighteen fundamentals, multiplied by eight (for the reason stated above), give 144 as the total number of different ways of placing the cards.
The reader may find a solution quite easy in a little over 200 moves, but, surprising as it may at first appear, not more than 62 moves are required. Here is the play: By "4 C up" I mean a transfer of the 4 of clubs with all the cards that rest on it. 1 D on space, 2 S on space, 3 D on space, 2 S on 3 D, 1 H on 2 S, 2 C on space, 1 D on 2 C, 4 S on space, 3 H on 4 S (9 moves so far), 2 S up on 3 H (3 moves), 5 H and 5 D exchanged, and 4 C on 5 D (6 moves), 3 D on 4 C (1), 6 S (with 5 H) on space (3), 4 C up on 5 H (3), 2 C up on 3 D (3), 7 D on space (1), 6 C up on 7 D (3), 8 S on space (1), 7 H on 8 S (1), 8 C on 9 D (1), 7 H on 8 C (1), 8 S on 9 H (1), 7 H on 8 S (1), 7 D up on 8 C (5), 4 C up on 5 D (9), 6 S up on 7 H (3), 4 S up on 5 H (7) = 62 moves in all. This is my record; perhaps the reader can beat it.
386.—A TRICK WITH DICE.
All you have to do is to deduct 250 from the result given, and the three figures in the answer will be the three points thrown with the dice. Thus, in the throw we gave, the number given would be 386; and when we deduct 250 we get 136, from which we know that the throws were 1, 3, and 6.
The process merely consists in giving 100a + 10b + c + 250, where a, b, and c represent the three throws. The result is obvious.
387.—THE VILLAGE CRICKET MATCH.
Mr. Dumkins >> > > < - -> 1 < - < -> < - -> < << Mr. Podder
Mr. Luffey >> > > < - -> 2 < - -> < < << Mr. Struggles
The diagram No. 1 will show that as neither Mr. Podder nor Mr. Dumkins can ever have been within the crease opposite to that from which he started, Mr. Dumkins would score nothing by his performance. Diagram No. 2 will, however, make it clear that since Mr. Luffey and Mr. Struggles have, notwithstanding their energetic but careless movements, contrived to change places, the manoeuvre must increase Mr. Struggles's total by one run.
The captain must have been "not out" and scored 21. Thus:—
2 men (each lbw) 19 4 men (each caught) 17 1 man (run out) 0 3 men (each bowled) 9 1 man (captain—not out) 21 — — 11 66
The captain thus scored exactly 15 more than the average of the team. The "others" who were bowled could only refer to three men, as the eleventh man would be "not out." The reader can discover for himself why the captain must have been that eleventh man. It would not necessarily follow with any figures.
389.—THE FOOTBALL PLAYERS.
The smallest possible number of men is seven. They could be accounted for in three different ways: 1. Two with both arms sound, one with broken right arm, and four with both arms broken. 2. One with both arms sound, one with broken left arm, two with broken right arm, and three with both arms broken. 3. Two with left arm broken, three with right arm broken, and two with both arms broken. But if every man was injured, the last case is the only one that would apply.
390.—THE HORSE-RACE PUZZLE.
The answer is: L12 on Acorn, L15 on Bluebottle, L20 on Capsule.
391.—THE MOTOR-CAR RACE.
The first point is to appreciate the fact that, in a race round a circular track, there are the same number of cars behind one as there are before. All the others are both behind and before. There were thirteen cars in the race, including Gogglesmith's car. Then one-third of twelve added to three-quarters of twelve will give us thirteen—the correct answer.
392.—THE PEBBLE GAME.
In the case of fifteen pebbles, the first player wins if he first takes two. Then when he holds an odd number and leaves 1, 8, or 9 he wins, and when he holds an even number and leaves 4, 5, or 12 he also wins. He can always do one or other of these things until the end of the game, and so defeat his opponent. In the case of thirteen pebbles the first player must lose if his opponent plays correctly. In fact, the only numbers with which the first player ought to lose are 5 and multiples of 8 added to 5, such as 13, 21, 29, etc.
393.—THE TWO ROOKS.
The second player can always win, but to ensure his doing so he must always place his rook, at the start and on every subsequent move, on the same diagonal as his opponent's rook. He can then force his opponent into a corner and win. Supposing the diagram to represent the positions of the rooks at the start, then, if Black played first, White might have placed his rook at A and won next move. Any square on that diagonal from A to H will win, but the best play is always to restrict the moves of the opposing rook as much as possible. If White played first, then Black should have placed his rook at B (F would not be so good, as it gives White more scope); then if White goes to C, Black moves to D; White to E, Black to F; White to G, Black to C; White to H, Black to I; and Black must win next move. If at any time Black had failed to move on to the same diagonal as White, then White could take Black's diagonal and win.
r: black rook R: white rook
+-+-+-+-+-+-+-+-+ r +-+-+-+-+-+-+-+-+ A +-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+ B D F +-+-+-+-+-+-+-+-+ R C E +-+-+-+-+-+-+-+-+ I G +-+-+-+-+-+-+-+-+ H +-+-+-+-+-+-+-+-+
THE TWO ROOKS.
394.—PUSS IN THE CORNER.
No matter whether he plays first or second, the player A, who starts the game at 55, must win. Assuming that B adopts the very best lines of play in order to prolong as much as possible his existence, A, if he has first move, can always on his 12th move capture B; and if he has the second move, A can always on his 14th move make the capture. His point is always to get diagonally in line with his opponent, and by going to 33, if he has first move, he prevents B getting diagonally in line with himself. Here are two good games. The number in front of the hyphen is always A's move; that after the hyphen is B's:—
33-8, 32-15, 31-22, 30-21, 29-14, 22-7, 15-6, 14-2, 7-3, 6-4, 11-, and A must capture on his next (12th) move, -13, 54-20, 53-27, 52-34, 51-41, 50-34, 42-27, 35-20, 28-13, 21-6, 14-2, 7-3, 6-4, 11-, and A must capture on his next (14th) move.
395.—A WAR PUZZLE GAME.
The Britisher can always catch the enemy, no matter how clever and elusive that astute individual may be; but curious though it may seem, the British general can only do so after he has paid a somewhat mysterious visit to the particular town marked "1" in the map, going in by 3 and leaving by 2, or entering by 2 and leaving by 3. The three towns that are shaded and have no numbers do not really come into the question, as some may suppose, for the simple reason that the Britisher never needs to enter any one of them, while the enemy cannot be forced to go into them, and would be clearly ill-advised to do so voluntarily. We may therefore leave these out of consideration altogether. No matter what the enemy may do, the Britisher should make the following first nine moves: He should visit towns 24, 20, 19, 15, 11, 7, 3, 1, 2. If the enemy takes it into his head also to go to town 1, it will be found that he will have to beat a precipitate retreat the same way that he went in, or the Britisher will infallibly catch him in towns 2 or 3, as the case may be. So the enemy will be wise to avoid that north-west corner of the map altogether.
Now, when the British general has made the nine moves that I have given, the enemy will be, after his own ninth move, in one of the towns marked 5, 8, 11, 13, 14, 16, 19, 21, 24, or 27. Of course, if he imprudently goes to 3 or 6 at this point he will be caught at once. Wherever he may happen to be, the Britisher "goes for him," and has no longer any difficulty in catching him in eight more moves at most (seventeen in all) in one of the following ways. The Britisher will get to 8 when the enemy is at 5, and win next move; or he will get to 19 when the enemy is at 22, and win next move; or he will get to 24 when the enemy is at 27, and so win next move. It will be found that he can be forced into one or other of these fatal positions.
In short, the strategy really amounts to this: the Britisher plays the first nine moves that I have given, and although the enemy does his very best to escape, our general goes after his antagonist and always driving him away from that north-west corner ultimately closes in with him, and wins. As I have said, the Britisher never need make more than seventeen moves in all, and may win in fewer moves if the enemy plays badly. But after playing those first nine moves it does not matter even if the Britisher makes a few bad ones. He may lose time, but cannot lose his advantage so long as he now keeps the enemy from town 1, and must eventually catch him.
This is a complete explanation of the puzzle. It may seem a little complex in print, but in practice the winning play will now be quite easy to the reader. Make those nine moves, and there ought to be no difficulty whatever in finding the concluding line of play. Indeed, it might almost be said that then it is difficult for the British general not to catch the enemy. It is a question of what in chess we call the "opposition," and the visit by the Britisher to town 1 "gives him the jump" on the enemy, as the man in the street would say.
Here is an illustrative example in which the enemy avoids capture as long as it is possible for him to do so. The Britisher's moves are above the line and the enemy's below it. Play them alternately.
24 20 19 15 11 7 3 1 2 6 10 14 18 19 20 24 ———————————————————————- 13 9 13 17 21 20 24 23 19 15 19 23 24 25 27
The enemy must now go to 25 or B, in either of which towns he is immediately captured.
396.—A MATCH MYSTERY.
If you form the three heaps (and are therefore the second to draw), any one of the following thirteen groupings will give you a win if you play correctly: 15, 14, 1; 15, 13, 2; 15, 12, 3; 15, 11, 4; 15, 10, 5; 15, 9, 6; 15, 8, 7; 14, 13, 3; 14, 11, 5; 14, 9, 7; 13, 11, 6; 13, 10, 7; 12, 11, 7.
The beautiful general solution of this problem is as follows. Express the number in every heap in powers of 2, avoiding repetitions and remembering that 2^0 = 1. Then if you so leave the matches to your opponent that there is an even number of every power, you can win. And if at the start you leave the powers even, you can always continue to do so throughout the game. Take, as example, the last grouping given above—12, 11, 7. Expressed in powers of 2 we have—
12 = 8 4 - - 11 = 8 - 2 1 7 = - 4 2 1 ———- 2 2 2 2 ———-
As there are thus two of every power, you must win. Say your opponent takes 7 from the 12 heap. He then leaves—
5 = - 4 - 1 11 = 8 - 2 1 7 = - 4 2 1 ———- 1 2 2 3 ———-
Here the powers are not all even in number, but by taking 9 from the 11 heap you immediately restore your winning position, thus—
5 = - 4 - 1 2 = - - 2 - 7 = - 4 2 1 ———- - 2 2 2 ———-
And so on to the end. This solution is quite general, and applies to any number of matches and any number of heaps. A correspondent informs me that this puzzle game was first propounded by Mr. W.M.F. Mellor, but when or where it was published I have not been able to ascertain.
397.—THE MONTENEGRIN DICE GAME.
The players should select the pairs 5 and 9, and 13 and 15, if the chances of winning are to be quite equal. There are 216 different ways in which the three dice may fall. They may add up 5 in 6 different ways and 9 in 25 different ways, making 31 chances out of 216 for the player who selects these numbers. Also the dice may add up 13 in 21 different ways, and 15 in 10 different ways, thus giving the other player also 31 chances in 216.
398.—THE CIGAR PUZZLE.
Not a single member of the club mastered this puzzle, and yet I shall show that it is so simple that the merest child can understand its solution—when it is pointed out to him! The large majority of my friends expressed their entire bewilderment. Many considered that "the theoretical result, in any case, is determined by the relationship between the table and the cigars;" others, regarding it as a problem in the theory of Probabilities, arrived at the conclusion that the chances are slightly in favour of the first or second player, as the case may be. One man took a table and a cigar of particular dimensions, divided the table into equal sections, and proceeded to make the two players fill up these sections so that the second player should win. But why should the first player be so accommodating? At any stage he has only to throw down a cigar obliquely across several of these sections entirely to upset Mr. 2's calculations! We have to assume that each player plays the best possible; not that one accommodates the other.
The theories of some other friends would be quite sound if the shape of the cigar were that of a torpedo—perfectly symmetrical and pointed at both ends.
I will show that the first player should infallibly win, if he always plays in the best possible manner. Examine carefully the following diagram, No. 1, and all will be clear.
The first player must place his first cigar on end in the exact centre of the table, as indicated by the little circle. Now, whatever the second player may do throughout, the first player must always repeat it in an exactly diametrically opposite position. Thus, if the second player places a cigar at A, I put one at AA; he places one at B, I put one at BB; he places one at C, I put one at CC; he places one at D, I put one at DD; he places one at E, I put one at EE; and so on until no more cigars can be placed without touching. As the cigars are supposed to be exactly alike in every respect, it is perfectly clear that for every move that the second player may choose to make, it is possible exactly to repeat it on a line drawn through the centre of the table. The second player can always duplicate the first player's move, no matter where he may place a cigar, or whether he places it on end or on its side. As the cigars are all alike in every respect, one will obviously balance over the edge of the table at precisely the same point as another. Of course, as each player is supposed to play in the best possible manner, it becomes a matter of theory. It is no valid objection to say that in actual practice one would not be sufficiently exact to be sure of winning. If as the first player you did not win, it would be in consequence of your not having played the best possible.
The second diagram will serve to show why the first cigar must be placed on end. (And here I will say that the first cigar that I selected from a box I was able so to stand on end, and I am allowed to assume that all the other cigars would do the same.) If the first cigar were placed on its side, as at F, then the second player could place a cigar as at G—as near as possible, but not actually touching F. Now, in this position you cannot repeat his play on the opposite side, because the two ends of the cigar are not alike. It will be seen that GG, when placed on the opposite side in the same relation to the centre, intersects, or lies on top of, F, whereas the cigars are not allowed to touch. You must therefore put the cigar farther away from the centre, which would result in your having insufficient room between the centre and the bottom left-hand corner to repeat everything that the other player would do between G and the top right-hand corner. Therefore the result would not be a certain win for the first player.
399.—THE TROUBLESOME EIGHT.
The conditions were to place a different number in each of the nine cells so that the three rows, three columns, and two diagonals should each add up 15. Probably the reader at first set himself an impossible task through reading into these conditions something which is not there—a common error in puzzle-solving. If I had said "a different figure," instead of "a different number," it would have been quite impossible with the 8 placed anywhere but in a corner. And it would have been equally impossible if I had said "a different whole number." But a number may, of course, be fractional, and therein lies the secret of the puzzle. The arrangement shown in the figure will be found to comply exactly with the conditions: all the numbers are different, and the square adds up 15 in all the required eight ways.
400.—THE MAGIC STRIPS.
There are of course six different places between the seven figures in which a cut may be made, and the secret lies in keeping one strip intact and cutting each of the other six in a different place. After the cuts have been made there are a large number of ways in which the thirteen pieces may be placed together so as to form a magic square. Here is one of them:—
The arrangement has some rather interesting features. It will be seen that the uncut strip is at the top, but it will be found that if the bottom row of figures be placed at the top the numbers will still form a magic square, and that every successive removal from the bottom to the top (carrying the uncut strip stage by stage to the bottom) will produce the same result. If we imagine the numbers to be on seven complete perpendicular strips, it will be found that these columns could also be moved in succession from left to right or from right to left, each time producing a magic square.
401.—EIGHT JOLLY GAOL-BIRDS.
There are eight ways of forming the magic square—all merely different aspects of one fundamental arrangement. Thus, if you give our first square a quarter turn you will get the second square; and as the four sides may be in turn brought to the top, there are four aspects. These four in turn reflected in a mirror produce the remaining four aspects. Now, of these eight arrangements only four can possibly be reached under the conditions, and only two of these four can be reached in the fewest possible moves, which is nineteen. These two arrangements are shown. Move the men in the following order: 5, 3, 2, 5, 7, 6, 4, 1, 5, 7, 6, 4, 1, 6, 4, 8, 3, 2, 7, and you get the first square. Move them thus: 4, 1, 2, 4, 1, 6, 7, 1, 5, 8, 1, 5, 6, 7, 5, 6, 4, 2, 7, and you have the arrangement in the second square. In the first case every man has moved, but in the second case the man numbered 3 has never left his cell. Therefore No. 3 must be the obstinate prisoner, and the second square must be the required arrangement.
402.—NINE JOLLY GAOL BIRDS.
There is a pitfall set for the unwary in this little puzzle. At the start one man is allowed to be placed on the shoulders of another, so as to give always one empty cell to enable the prisoners to move about without any two ever being in a cell together. The two united prisoners are allowed to add their numbers together, and are, of course, permitted to remain together at the completion of the magic square. But they are obviously not compelled so to remain together, provided that one of the pair on his final move does not break the condition of entering a cell already occupied. After the acute solver has noticed this point, it is for him to determine which method is the better one—for the two to be together at the count or to separate. As a matter of fact, the puzzle can be solved in seventeen moves if the men are to remain together; but if they separate at the end, they may actually save a move and perform the feat in sixteen! The trick consists in placing the man in the centre on the back of one of the corner men, and then working the pair into the centre before their final separation.
Here are the moves for getting the men into one or other of the above two positions. The numbers are those of the men in the order in which they move into the cell that is for the time being vacant. The pair is shown in brackets:—
Place 5 on 1. Then, 6, 9, 8, 6, 4, (6), 2, 4, 9, 3, 4, 9, (6), 7, 6, 1.
Place 5 on 9. Then, 4, 1, 2, 4, 6, (14), 8, 6, 1, 7, 6, 1, (14), 3, 4, 9.
Place 5 on 3. Then, 6, (8), 2, 6, 4, 7, 8, 4, 7, 1, 6, 7, (8), 9, 4, 3.
Place 5 on 7. Then, 4, (12), 8, 4, 6, 3, 2, 6, 3, 9, 4, 3, (12), 1, 6, 7.
The first and second solutions produce Diagram A; the second and third produce Diagram B. There are only sixteen moves in every case. Having found the fewest moves, we had to consider how we were to make the burdened man do as little work as possible. It will at once be seen that as the pair have to go into the centre before separating they must take at fewest two moves. The labour of the burdened man can only be reduced by adopting the other method of solution, which, however, forces us to take another move.
403.—THE SPANISH DUNGEON.
- - - -+ + - - - - 1 2 3 4 10 9 7 4 5 6 7 8 6 5 11 8 9 10 11 12 1 2 12 15 13 14 15 13 14 3 - - - -+ + - - - -
This can best be solved by working backwards—that is to say, you must first catch your square, and then work back to the original position. We must first construct those squares which are found to require the least amount of readjustment of the numbers. Many of these we know cannot possibly be reached. When we have before us the most favourable possible arrangements, it then becomes a question of careful analysis to discover which position can be reached in the fewest moves. I am afraid, however, it is only after considerable study and experience that the solver is able to get such a grasp of the various "areas of disturbance" and methods of circulation that his judgment is of much value to him.
The second diagram is a most favourable magic square position. It will be seen that prisoners 4, 8, 13, and 14 are left in their original cells. This position may be reached in as few as thirty-seven moves. Here are the moves: 15, 14, 10, 6, 7, 3, 2, 7, 6, 11, 3, 2, 7, 6, 11, 10, 14, 3, 2, 11, 10, 9, 5, 1, 6, 10, 9, 5, 1, 6, 10, 9, 5, 2, 12, 15, 3. This short solution will probably surprise many readers who may not find a way under from sixty to a hundred moves. The clever prisoner was No. 6, who in the original illustration will be seen with his arms extended calling out the moves. He and No. 10 did most of the work, each changing his cell five times. No. 12, the man with the crooked leg, was lame, and therefore fortunately had only to pass from his cell into the next one when his time came round.
404.—THE SIBERIAN DUNGEONS.
- - - -+ 8 5 10 11 16 13 2 3 1 12 7 14 9 4 15 6 + - - - -
In attempting to solve this puzzle it is clearly necessary to seek such magic squares as seem the most favourable for our purpose, and then carefully examine and try them for "fewest moves." Of course it at once occurs to us that if we can adopt a square in which a certain number of men need not leave their original cells, we may save moves on the one hand, but we may obstruct our movements on the other. For example, a magic square may be formed with the 6, 7, 13, and 16 unmoved; but in such case it is obvious that a solution is impossible, since cells 14 and 15 can neither be left nor entered without breaking the condition of no two men ever being in the same cell together.
The following solution in fourteen moves was found by Mr. G. Wotherspoon: 8-17, 16-21, 6-16, 14-8, 5-18, 4-14, 3-24, 11-20, 10-19, 2-23, 13-22, 12-6, 1-5, 9-13. As this solution is in what I consider the theoretical minimum number of moves, I am confident that it cannot be improved upon, and on this point Mr. Wotherspoon is of the same opinion.
405.—CARD MAGIC SQUARES.
Arrange the cards as follows for the three new squares:—
3 2 4 6 5 7 9 8 10 4 3 2 7 6 5 10 9 8 2 4 3 5 7 6 8 10 9
Three aces and one ten are not used. The summations of the four squares are thus: 9, 15, 18, and 27—all different, as required.
406.—THE EIGHTEEN DOMINOES.
The illustration explains itself. It will be found that the pips in every column, row, and long diagonal add up 18, as required.
407.—TWO NEW MAGIC SQUARES.
Here are two solutions that fulfil the conditions:—
The first, by subtracting, has a constant 8, and the associated pairs all have a difference of 4. The second square, by dividing, has a constant 9, and all the associated pairs produce 3 by division. These are two remarkable and instructive squares.
408.—MAGIC SQUARES OF TWO DEGREES.
The following is the square that I constructed. As it stands the constant is 260. If for every number you substitute, in its allotted place, its square, then the constant will be 11,180. Readers can write out for themselves the second degree square.
The main key to the solution is the pretty law that if eight numbers sum to 260 and their squares to 11,180, then the same will happen in the case of the eight numbers that are complementary to 65. Thus 1 + 18 + 23 + 26 + 31 + 48 + 56 + 57 = 260, and the sum of their squares is 11,180. Therefore 64 + 47 + 42 + 39 + 34 + 17 + 9 + 8 (obtained by subtracting each of the above numbers from 65) will sum to 260 and their squares to 11,180. Note that in every one of the sixteen smaller squares the two diagonals sum to 65. There are four columns and four rows with their complementary columns and rows. Let us pick out the numbers found in the 2nd, 1st, 4th, and 3rd rows and arrange them thus :—
Here each column contains four consecutive numbers cyclically arranged, four running in one direction and four in the other. The numbers in the 2nd, 5th, 3rd, and 8th columns of the square may be similarly grouped. The great difficulty lies in discovering the conditions governing these groups of numbers, the pairing of the complementaries in the squares of four and the formation of the diagonals. But when a correct solution is shown, as above, it discloses all the more important keys to the mystery. I am inclined to think this square of two degrees the most elegant thing that exists in magics. I believe such a magic square cannot be constructed in the case of any order lower than 8.
409.—THE BASKETS OF PLUMS.
As the merchant told his man to distribute the contents of one of the baskets of plums "among some children," it would not be permissible to give the complete basketful to one child; and as it was also directed that the man was to give "plums to every child, so that each should receive an equal number," it would also not be allowed to select just as many children as there were plums in a basket and give each child a single plum. Consequently, if the number of plums in every basket was a prime number, then the man would be correct in saying that the proposed distribution was quite impossible. Our puzzle, therefore, resolves itself into forming a magic square with nine different prime numbers.
A B - - - - - - 7 61 43 83 29 101 73 37 1 89 71 53 31 13 67 41 113 59 - - - - - -
C D - - - - - - 103 79 37 1669 199 1249 7 73 139 619 1039 1459 109 67 43 829 1879 409 - - - - - -
In Diagram A we have a magic square in prime numbers, and it is the one giving the smallest constant sum that is possible. As to the little trap I mentioned, it is clear that Diagram A is barred out by the words "every basket contained plums," for one plum is not plums. And as we were referred to the baskets, "as shown in the illustration," it is perfectly evident, without actually attempting to count the plums, that there are at any rate more than 7 plums in every basket. Therefore C is also, strictly speaking, barred. Numbers over 20 and under, say, 250 would certainly come well within the range of possibility, and a large number of arrangements would come within these limits. Diagram B is one of them. Of course we can allow for the false bottoms that are so frequently used in the baskets of fruitsellers to make the basket appear to contain more fruit than it really does.
Several correspondents assumed (on what grounds I cannot think) that in the case of this problem the numbers cannot be in consecutive arithmetical progression, so I give Diagram D to show that they were mistaken. The numbers are 199, 409, 619, 829, 1,039, 1,249, 1,459, 1,669, and 1,879—all primes with a common difference of 210.
410.—THE MANDARIN'S "T" PUZZLE.
There are many different ways of arranging the numbers, and either the 2 or the 3 may be omitted from the "T" enclosure. The arrangement that I give is a "nasik" square. Out of the total of 28,800 nasik squares of the fifth order this is the only one (with its one reflection) that fulfils the "T" condition. This puzzle was suggested to me by Dr. C. Planck.
[Illustration: THE MANDARIN'S "T" PUZZLE.
- - - - - 19 23 11 5 7 1 10 17 24 13 22 14 3 6 20 8 16 25 12 4 15 2 9 18 21 - - - - -
411.—A MAGIC SQUARE OF COMPOSITES.
The problem really amounts to finding the smallest prime such that the next higher prime shall exceed it by 10 at least. If we write out a little list of primes, we shall not need to exceed 150 to discover what we require, for after 113 the next prime is 127. We can then form the square in the diagram, where every number is composite. This is the solution in the smallest numbers. We thus see that the answer is arrived at quite easily, in a square of the third order, by trial. But I propose to show how we may get an answer (not, it is true, the one in smallest numbers) without any tables or trials, but in a very direct and rapid manner.
- - - 121 114 119 116 118 120 117 122 115 - - -
First write down any consecutive numbers, the smallest being greater than 1—say, 2, 3, 4, 5, 6, 7, 8, 9, 10. The only factors in these numbers are 2, 3, 5, and 7. We therefore multiply these four numbers together and add the product, 210, to each of the nine numbers. The result is the nine consecutive composite numbers, 212 to 220 inclusive, with which we can form the required square. Every number will necessarily be divisible by its difference from 210. It will be very obvious that by this method we may find as many consecutive composites as ever we please. Suppose, for example, we wish to form a magic square of sixteen such numbers; then the numbers 2 to 17 contain the factors 2, 3, 5, 7, 11, 13, and 17, which, multiplied together, make 510510 to be added to produce the sixteen numbers 510512 to 510527 inclusive, all of which are composite as before.
But, as I have said, these are not the answers in the smallest numbers: for if we add 523 to the numbers 1 to 16, we get sixteen consecutive composites; and if we add 1,327 to the numbers 1 to 25, we get twenty-five consecutive composites, in each case the smallest numbers possible. Yet if we required to form a magic square of a hundred such numbers, we should find it a big task by means of tables, though by the process I have shown it is quite a simple matter. Even to find thirty-six such numbers you will search the tables up to 10,000 without success, and the difficulty increases in an accelerating ratio with each square of a larger order.
412.—THE MAGIC KNIGHT'S TOUR.
+ + + + + + + + + 46 55 44 19 58 9 22 7 + + + + + + + + + 43 18 47 56 21 6 59 10 + + + + + + + + + 54 45 20 41 12 57 8 23 + + + + + + + + + 17 42 53 48 5 24 11 60 + + + + + + + + + 52 3 32 13 40 61 34 25 + + + + + + + + + 31 16 49 4 33 28 37 62 + + + + + + + + + 2 51 14 29 64 39 26 35 + + + + + + + + + 15 30 1 50 27 36 63 38 + + + + + + + + +
Here each successive number (in numerical order) is a knight's move from the preceding number, and as 64 is a knight's move from 1, the tour is "re-entrant." All the columns and rows add up 260. Unfortunately, it is not a perfect magic square, because the diagonals are incorrect, one adding up 264 and the other 256—requiring only the transfer of 4 from one diagonal to the other. I think this is the best result that has ever been obtained (either re-entrant or not), and nobody can yet say whether a perfect solution is possible or impossible.
413.—A CHESSBOARD FALLACY.
The explanation of this little fallacy is as follows. The error lies in assuming that the little triangular piece, marked C, is exactly the same height as one of the little squares of the board. As a matter of fact, its height (if we make the sixty-four squares each a square inch) will be 1+1/7 in. Consequently the rectangle is really 9+1/7 in. by 7 in., so that the area is sixty-four square inches in either case. Now, although the pieces do fit together exactly to form the perfect rectangle, yet the directions of the horizontal lines in the pieces will not coincide. The new diagram above will make everything quite clear to the reader.
414.—WHO WAS FIRST?
Biggs, who saw the smoke, would be first; Carpenter, who saw the bullet strike the water, would be second; and Anderson, who heard the report, would be last of all.
415.—A WONDERFUL VILLAGE.
When the sun is in the horizon of any place (whether in Japan or elsewhere), he is the length of half the earth's diameter more distant from that place than in his meridian at noon. As the earth's semi-diameter is nearly 4,000 miles, the sun must be considerably more than 3,000 miles nearer at noon than at his rising, there being no valley even the hundredth part of 1,000 miles deep.
416.—A CALENDAR PUZZLE.
The first day of a century can never fall on a Sunday; nor on a Wednesday or a Friday.
I will give my complete working of the solution, so that readers may see how easy it is when you know how to proceed. And first of all, as there is an even number of rings, I will say that they may all be taken off in one-third of (2^(n + 1) - 2) moves; and since n in our case is 14, all the rings may be taken off in 10,922 moves. Then I say 10,922 - 9,999 = 923, and proceed to find the position when only 923 out of the 10,922 moves remain to be made. Here is the curious method of doing this. It is based on the binary scale method used by Monsieur L. Gros, for an account of which see W.W. Rouse Ball's Mathematical Recreations.
Divide 923 by 2, and we get 461 and the remainder 1; divide 461 by 2, and we get 230 and the remainder 1; divide 230 by 2, and we get 115 and the remainder nought. Keep on dividing by 2 in this way as long as possible, and all the remainders will be found to be 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, the last remainder being to the left and the first remainder to the right. As there are fourteen rings and only ten figures, we place the difference, in the form of four noughts, in brackets to the left, and bracket all those figures that repeat a figure on their left. Then we get the following arrangement: (0 0 0 0) 1 (1 1) 0 (0) 1 (1) 0 1 (1). This is the correct answer to the puzzle, for if we now place rings below the line to represent the figures in brackets and rings on the line for the other figures, we get the solution in the required form, as below:—
O O O OO ————————————- OOOO OO O O O
This is the exact position of the rings after the 9,999th move has been made, and the reader will find that the method shown will solve any similar question, no matter how many rings are on the tiring-irons. But in working the inverse process, where you are required to ascertain the number of moves necessary in order to reach a given position of the rings, the rule will require a little modification, because it does not necessarily follow that the position is one that is actually reached in course of taking off all the rings on the irons, as the reader will presently see. I will here state that where the total number of rings is odd the number of moves required to take them all off is one-third of (2^(n + 1) - 1).
With n rings (where n is odd) there are 2^n positions counting all on and all off. In (1/3)(2^(n + 1) + 2) positions they are all removed. The number of positions not used is (1/3)(2^n - 2).
With n rings (where n is even) there are 2^n positions counting all on and all off. In (2^(n + 1) + 1) positions they are all removed. The number of positions not used is here (1/3)(2^n - 1).
It will be convenient to tabulate a few cases.
+ + + -+ -+ No. of Total Positions Positions Rings. Positions. used. not used. + + + -+ -+ 1 2 2 0 3 8 6 2 5 32 22 10 7 128 86 42 9 512 342 170 2 4 3 1 4 16 11 5 6 64 43 21 8 256 171 85 10 1024 683 341 + + + -+ -+
Note first that the number of positions used is one more than the number of moves required to take all the rings off, because we are including "all on" which is a position but not a move. Then note that the number of positions not used is the same as the number of moves used to take off a set that has one ring fewer. For example, it takes 85 moves to remove 7 rings, and the 42 positions not used are exactly the number of moves required to take off a set of 6 rings. The fact is that if there are 7 rings and you take off the first 6, and then wish to remove the 7th ring, there is no course open to you but to reverse all those 42 moves that never ought to have been made. In other words, you must replace all the 7 rings on the loop and start afresh! You ought first to have taken off 5 rings, to do which you should have taken off 3 rings, and previously to that 1 ring. To take off 6 you first remove 2 and then 4 rings.
418.—SUCH A GETTING UPSTAIRS.
Number the treads in regular order upwards, 1 to 8. Then proceed as follows: 1 (step back to floor), 1, 2, 3 (2), 3, 4, 5 (4), 5, 6, 7 (6), 7, 8, landing (8), landing. The steps in brackets are taken in a backward direction. It will thus be seen that by returning to the floor after the first step, and then always going three steps forward for one step backward, we perform the required feat in nineteen steps.
419.—THE FIVE PENNIES.
First lay three of the pennies in the way shown in Fig. 1. Now hold the remaining two pennies in the position shown in Fig. 2, so that they touch one another at the top, and at the base are in contact with the three horizontally placed coins. Then the five pennies will be equidistant, for every penny will touch every other penny.
420.—THE INDUSTRIOUS BOOKWORM.
The hasty reader will assume that the bookworm, in boring from the first to the last page of a book in three volumes, standing in their proper order on the shelves, has to go through all three volumes and four covers. This, in our case, would mean a distance of 91/2 in., which is a long way from the correct answer. You will find, on examining any three consecutive volumes on your shelves, that the first page of Vol. I. and the last page of Vol. III. are actually the pages that are nearest to Vol. II., so that the worm would only have to penetrate four covers (together, 1/2 in.) and the leaves in the second volume (3 in.), or a distance of 31/2 inches, in order to tunnel from the first page to the last.
421.—A CHAIN PUZZLE.
To open and rejoin a link costs threepence. Therefore to join the nine pieces into an endless chain would cost 2s. 3d., whereas a new chain would cost 2s. 2d. But if we break up the piece of eight links, these eight will join together the remaining eight pieces at a cost of 2s. But there is a subtle way of even improving on this. Break up the two pieces containing three and four links respectively, and these seven will join together the remaining seven pieces at a cost of only 1s. 9d.
422.—THE SABBATH PUZZLE.
The way the author of the old poser proposed to solve the difficulty was as follows: From the Jew's abode let the Christian and the Turk set out on a tour round the globe, the Christian going due east and the Turk due west. Readers of Edgar Allan Poe's story, Three Sundays in a Week, or of Jules Verne's Round the World in Eighty Days, will know that such a proceeding will result in the Christian's gaining a day and in the Turk's losing a day, so that when they meet again at the house of the Jew their reckoning will agree with his, and all three may keep their Sabbath on the same day. The correctness of this answer, of course, depends on the popular notion as to the definition of a day—the average duration between successive sun-rises. It is an old quibble, and quite sound enough for puzzle purposes. Strictly speaking, the two travellers ought to change their reckonings on passing the 180th meridian; otherwise we have to admit that at the North or South Pole there would only be one Sabbath in seven years.
423.—THE RUBY BROOCH.
In this case we were shown a sketch of the brooch exactly as it appeared after the four rubies had been stolen from it. The reader was asked to show the positions from which the stones "may have been taken;" for it is not possible to show precisely how the gems were originally placed, because there are many such ways. But an important point was the statement by Lady Littlewood's brother: "I know the brooch well. It originally contained forty-five stones, and there are now only forty-one. Somebody has stolen four rubies, and then reset as small a number as possible in such a way that there shall always be eight stones in any of the directions you have mentioned."
The diagram shows the arrangement before the robbery. It will be seen that it was only necessary to reset one ruby—the one in the centre. Any solution involving the resetting of more than one stone is not in accordance with the brother's statement, and must therefore be wrong. The original arrangement was, of course, a little unsymmetrical, and for this reason the brooch was described as "rather eccentric."
424.—THE DOVETAILED BLOCK.
The mystery is made clear by the illustration. It will be seen at once how the two pieces slide together in a diagonal direction.
425.—JACK AND THE BEANSTALK.
The serious blunder that the artist made in this drawing was in depicting the tendrils of
the bean climbing spirally as at A above, whereas the French bean, or scarlet runner, the variety clearly selected by the artist in the absence of any authoritative information on the point, always climbs as shown at B. Very few seem to be aware of this curious little fact. Though the bean always insists on a sinistrorsal growth, as B, the hop prefers to climb in a dextrorsal manner, as A. Why, is one of the mysteries that Nature has not yet unfolded.
426.—THE HYMN-BOARD POSER.
This puzzle is not nearly so easy as it looks at first sight. It was required to find the smallest possible number of plates that would be necessary to form a set for three hymn-boards, each of which would show the five hymns sung at any particular service, and then to discover the lowest possible cost for the same. The hymn-book contains 700 hymns, and therefore no higher number than 700 could possibly be needed.
Now, as we are required to use every legitimate and practical method of economy, it should at once occur to us that the plates must be painted on both sides; indeed, this is such a common practice in cases of this kind that it would readily occur to most solvers. We should also remember that some of the figures may possibly be reversed to form other figures; but as we were given a sketch of the actual shapes of these figures when painted on the plates, it would be seen that though the 6's may be turned upside down to make 9's, none of the other figures can be so treated.
It will be found that in the case of the figures 1, 2, 3, 4, and 5, thirty-three of each will be required in order to provide for every possible emergency; in the case of 7, 8, and 0, we can only need thirty of each; while in the case of the figure 6 (which may be reversed for the figure 9) it is necessary to provide exactly forty-two.
It is therefore clear that the total number of figures necessary is 297; but as the figures are painted on both sides of the plates, only 149 such plates are required. At first it would appear as if one of the plates need only have a number on one side, the other side being left blank. But here we come to a rather subtle point in the problem.
Readers may have remarked that in real life it is sometimes cheaper when making a purchase to buy more articles than we require, on the principle of a reduction on taking a quantity: we get more articles and we pay less. Thus, if we want to buy ten apples, and the price asked is a penny each if bought singly, or ninepence a dozen, we should both save a penny and get two apples more than we wanted by buying the full twelve. In the same way, since there is a regular scale of reduction for plates painted alike, we actually save by having two figures painted on that odd plate. Supposing, for example, that we have thirty plates painted alike with 5 on one side and 6 on the other. The rate would be 43/4d., and the cost 11s. 101/2d. But if the odd plate with, say, only a 5 on one side of it have a 6 painted on the other side, we get thirty-one plates at the reduced rate of 41/2d., thus saving a farthing on each of the previous thirty, and reducing the cost of the last one from 1s. to 41/2d.
But even after these points are all seen there comes in a new difficulty: for although it will be found that all the 8's may be on the backs of the 7's, we cannot have all the 2's on the backs of the 1's, nor all the 4 on the backs of the 3's, etc. There is a great danger, in our attempts to get as many as possible painted alike, of our so adjusting the figures that some particular combination of hymns cannot be represented.
Here is the solution of the difficulty that was sent to the vicar of Chumpley St. Winifred. Where the sign X is placed between two figures, it implies that one of these figures is on one side of the plate and the other on the other side.
d. L s. d. 31 plates painted 5 X 9 @ 41/2 = 0 11 71/2 30 " 7 X 8 @ 43/4 = 0 11 101/2 21 " 1 X 2 @ 7 = 0 12 3 21 " 3 X 0 @ 7 = 0 12 3 12 " 1 X 3 @ 91/4 = 0 9 3 12 " 2 X 4 @ 91/4 = 0 9 3 12 " 9 X 4 @ 91/4 = 0 9 3 8 " 4 X 0 @ 101/4 = 0 6 10 1 " 5 X 4 @ 12 = 0 1 0 1 " 5 X 0 @ 12 = 0 1 0 149 plates @ 6d. each = 3 14 6 ————— L7 19 1
Of course, if we could increase the number of plates, we might get the painting done for nothing, but such a contingency is prevented by the condition that the fewest possible plates must be provided.
This puzzle appeared in Tit-Bits, and the following remarks, made by me in the issue for 11th December 1897, may be of interest.
The "Hymn-Board Poser" seems to have created extraordinary interest. The immense number of attempts at its solution sent to me from all parts of the United Kingdom and from several Continental countries show a very kind disposition amongst our readers to help the worthy vicar of Chumpley St. Winifred over his parochial difficulty. Every conceivable estimate, from a few shillings up to as high a sum as L1,347, 10s., seems to have come to hand. But the astonishing part of it is that, after going carefully through the tremendous pile of correspondence, I find that only one competitor has succeeded in maintaining the reputation of the Tit-Bits solvers for their capacity to solve anything, and his solution is substantially the same as the one given above, the cost being identical. Some of his figures are differently combined, but his grouping of the plates, as shown in the first column, is exactly the same. Though a large majority of competitors clearly hit upon all the essential points of the puzzle, they completely collapsed in the actual arrangement of the figures. According to their methods, some possible selection of hymns, such as 111, 112, 121, 122,211, cannot be set up. A few correspondents suggested that it might be possible so to paint the 7's that upside down they would appear as 2's or 4's; but this would, of course, be barred out by the fact that a representation of the actual figures to be used was given.
The arithmetic of this puzzle is very easy indeed. There were clearly 24 pheasants at the start. Of these 16 were shot dead, 1 was wounded in the wing, and 7 got away. The reader may have concluded that the answer is, therefore, that "seven remained." But as they flew away it is clearly absurd to say that they "remained." Had they done so they would certainly have been killed. Must we then conclude that the 17 that were shot remained, because the others flew away? No; because the question was not "how many remained?" but "how many still remained?" Now the poor bird that was wounded in the wing, though unable to fly, was very active in its painful struggles to run away. The answer is, therefore, that the 16 birds that were shot dead "still remained," or "remained still."
428.—THE GARDENER AND THE COOK.
Nobody succeeded in solving the puzzle, so I had to let the cat out of the bag—an operation that was dimly foreshadowed by the puss in the original illustration. But I first reminded the reader that this puzzle appeared on April 1, a day on which none of us ever resents being made an "April Fool;" though, as I practically "gave the thing away" by specially drawing attention to the fact that it was All Fools' Day, it was quite remarkable that my correspondents, without a single exception, fell into the trap.
One large body of correspondents held that what the cook loses in stride is exactly made up in greater speed; consequently both advance at the same rate, and the result must be a tie. But another considerable section saw that, though this might be so in a race 200 ft. straight away, it could not really be, because they each go a stated distance at "every bound," and as 100 is not an exact multiple of 3, the gardener at his thirty-fourth bound will go 2 ft. beyond the mark. The gardener will, therefore, run to a point 102 ft. straight away and return (204 ft. in all), and so lose by 4 ft. This point certainly comes into the puzzle. But the most important fact of all is this, that it so happens that the gardener was a pupil from the Horticultural College for Lady Gardeners at, if I remember aright, Swanley; while the cook was a very accomplished French chef of the hemale persuasion! Therefore "she (the gardener) made three bounds to his (the cook's) two." It will now be found that while the gardener is running her 204 ft. in 68 bounds of 3 ft., the somewhat infirm old cook can only make 45+1/3 of his 2 ft. bounds, which equals 90 ft. 8 in. The result is that the lady gardener wins the race by 109 ft. 4 in. at a moment when the cook is in the air, one-third through his 46th bound.
The moral of this puzzle is twofold: (1) Never take things for granted in attempting to solve puzzles; (2) always remember All Fools' Day when it comes round. I was not writing of any gardener and cook, but of a particular couple, in "a race that I witnessed." The statement of the eye-witness must therefore be accepted: as the reader was not there, he cannot contradict it. Of course the information supplied was insufficient, but the correct reply was: "Assuming the gardener to be the 'he,' the cook wins by 4 ft.; but if the gardener is the 'she,' then the gardener wins by 109 ft. 4 in." This would have won the prize. Curiously enough, one solitary competitor got on to the right track, but failed to follow it up. He said: "Is this a regular April 1 catch, meaning that they only ran 6 ft. each, and consequently the race was unfinished? If not, I think the following must be the solution, supposing the gardener to be the 'he' and the cook the 'she.'" Though his solution was wrong even in the case he supposed, yet he was the only person who suspected the question of sex.
Thirteen coins may be placed as shown on page 252.
430.—FIND THE MAN'S WIFE.
There is no guessing required in this puzzle. It is all a question of elimination. If we can pair off any five of the ladies with their respective husbands, other than husband No. 10, then the remaining lady must be No. 10's wife.
I will show how this may be done. No. 8 is seen carrying a lady's parasol in the same hand with his walking-stick. But every lady is provided with a parasol, except No. 3; therefore No. 3 may be safely said to be the wife of No. 8. Then No. 12 is holding a bicycle, and the dress-guard and make disclose the fact that it is a lady's bicycle. The only lady in a cycling skirt is No. 5; therefore we conclude that No. 5 is No. 12's wife. Next, the man No. 6 has a dog, and lady No. 11 is seen carrying a dog chain. So we may safely pair No. 6 with No. 11. Then we see that man No. 2 is paying a newsboy for a paper. But we do not pay for newspapers in this way before receiving them, and the gentleman has apparently not taken one from the boy. But lady No. 9 is seen reading a paper. The inference is obvious—that she has sent the boy to her husband for a penny. We therefore pair No. 2 with No. 9. We have now disposed of all the ladies except Nos. 1 and 7, and of all the men except Nos. 4 and 10. On looking at No. 4 we find that he is carrying a coat over his arm, and that the buttons are on the left side;—not on the right, as a man wears them. So it is a lady's coat. But the coat clearly does not belong to No. 1, as she is seen to be wearing a coat already, while No. 7 lady is very lightly clad. We therefore pair No. 7 lady with man No. 4. Now the only lady left is No. 1, and we are consequently forced to the conclusion that she is the wife of No. 10. This is therefore the correct answer.
Abbot's Puzzle, The, 20, 161. —— Window, The, 87, 213.
Academic Courtesies, 18, 160.
Acrostic Puzzle, An, 84, 210.
Adam and Eve and the Apples, 18.
Aeroplanes, The Two, 2, 148.
Age and Kinship Puzzles, 6. —— Concerning Tommy's, 7, 153. —— Mamma's, 7, 152. —— Mrs. Timpkins's, 7, 152. —— Rover's, 7, 152.
Ages, The Family, 7, 152. —— Their, 7, 152.
Alcuin, Abbot, 20, 112.
Almonds, The Nine, 64, 195.
Amazons, The, 94, 221.
Andrews, W.S., 125.
Apples, A Deal in, 3, 149. —— Buying, 6, 151. —— The Ten, 64, 195.
Approximations in Dissection, 28.
Arithmetical and Algebraical Problems, 1. —— Various, 17.
Arthur's Knights, King, 77, 203.
Artillerymen's Dilemma, 26, 167.
Asparagus, Bundles of, 140.
Aspects all due South, 137.
Associated Magic Squares, 120.
Axiom, A Puzzling, 138.
Bachet de Meziriac, 90, 109, 112.
Bachet's Square, 90, 216.
Ball Problem, The, 51, 183.
Ball, W.W. Rouse, 109, 204, 248.
Balls, The Glass, 78, 204.
Banker's Puzzle, The, 25, 165.
Bank Holiday Puzzle, A, 73, 201.
Banner Puzzle, The, 46, 179. —— St. George's, 50, 182.
Barrel Puzzle, The, 109, 235.
Barrels of Balsam, The, 82, 208.
Beanfeast Puzzle, A, 2, 148.
Beef and Sausages, 3, 149.
Beer, The Barrel of, 13, 155.
Bell-ropes, Stealing the, 49, 181.
Bells, The Peal of, 78, 204.
Bergholt, E., 116, 119, 125.
Betsy Ross Puzzle, The, 40, 176.
Bicycle Thief, The, 6, 152.
Bishops—Guarded, 88, 214. —— in Convocation, 89, 215. —— Puzzle, A New, 98, 225. —— Unguarded, 88, 214.
Board, The Chess-, 85. —— in Compartments, The, 102, 228. —— Setting the, 105, 231.
Boards with Odd Number of Squares, 86, 212.
Boat, Three Men in a, 78, 204.
Bookworm, The Industrious, 143, 248.
Boothby, Guy, 154.
Box, The Cardboard, 49, 181. —— The Paper, 40.
Boys and Girls, 67, 197.
Bridges, The Monk and the, 75, 202.
Brigands, The Five, 25, 164.
Brocade, The Squares of, 47, 180.
Bun Puzzle, The, 35, 170.
Busschop, Paul, 172.
Buttons and String Method, 230.
Cab Numbers, The, 15, 157.
Calendar Puzzle, A, 142, 247.
Canterbury Puzzles, The, 14, 28, 58, 117, 121, 195, 202, 205, 206, 212, 213, 217, 233.
Card Frame Puzzle, The, 114, 238. —— Magic Squares, 123, 244. —— Players, A Puzzle for, 78, 203. —— Puzzle, The "T," 115, 239. —— Triangles, 115, 239.
Cards, The Cross of, 115, 238.
Carroll, Lewis, 43.
Castle Treasure, Stealing the, 113, 237.
Cats, the Wizard's, 42, 178.
Cattle, Judkins's, 6, 151. —— Market, At a, 1, 148.
Census Puzzle, A, 7, 152.
Century Puzzle, The, 16, 158. —— The Digital, 16, 159.
Chain Puzzle, A, 144, 249. —— The Antiquary's, 83, 209. —— The Cardboard, 40, 176.
Change, Giving, 4, 150. —— Ways of giving, 151.
Changing Places, 10, 154.
Channel Island, 138.
Charitable Bequest, A, 2, 148
Charity, Indiscriminate, 2, 148.
Checkmate, 107, 233.
Cheesemonger, The Eccentric, 66, 196.
Chequered Board Divisions, 85, 210.
Cherries and Plums, 56, 189.
Chess Puzzles, Dynamical, 96. —— Statical, 88. —— Various, 105. —— Queer, 107, 233.
Chessboard, The, 85. —— Fallacy, A, 141, 247. —— Guarded, 95. —— Non-attacking Arrangements, 96. —— Problems, 84. —— Sentence, The, 87, 214. —— Solitaire, 108, 234. —— The Chinese, 87, 213. —— The Crowded, 91, 217.
Chestnuts, Buying, 6, 152.
Chinese Money, 4, 150. —— Puzzle, Ancient, 107, 233. —— —— The Fashionable, 43.
Christmas Boxes, The, 4, 150. —— Present, Mrs. Smiley's, 46, 179. —— Pudding, The, 43, 178.
Cigar Puzzle, The, 119, 242.
Circle, The Dissected, 69, 197.
Cisterns, How to Make, 54, 188.
Civil Service "Howler," 154.
Clare, John, 58.
Clock Formulae, 154. —— Puzzles, 9. —— The Club, 10, 154. —— The Railway Station, 11, 155.
Clocks, The Three, 11, 154.
Clothes Line Puzzle, The, 50, 182.
Coast, Round the, 63, 195.
Coincidence, A Queer, 2, 148.
Coins, The Broken, 5, 150. —— The Ten, 57, 190. —— Two Ancient, 140.
Combination and Group Problems, 76.
Compasses Puzzle, The, 53, 186.
Composite Magic Squares, 127, 246.
Cone Puzzle, The, 55, 188.
Corn, Reaping the, 20, 161.
Cornfields, Farmer Lawrence's, 101, 227.
Costermonger's Puzzle, The, 6, 152.
Counter Problems, Moving, 58. —— Puzzle, A New, 98, 225. —— Solitaire, 107, 234.
Counters, The Coloured, 91, 217. —— The Forty-nine, 92, 217. —— The Nine, 14, 156. —— The Ten, 15, 156.
Crescent Puzzle, The, 52, 184.
Crescents of Byzantium, The Five, 92, 219.
Cricket Match, The Village, 116, 239. —— Slow, 116, 239.
Cross and Triangle, 35, 169. —— of Cards, 115, 238. —— The Folded, 35, 169. —— The Southern, 93, 220.
Crosses, Counter, 81, 207. —— from One, Two, 35, 168. —— —— Three, 169.
Crossing River Problems, 112.
Crusader, The, 106, 232.
Cubes, Sums of, 165.
Cushion Covers, The, 46, 179.
Cutting-out Puzzle, A, 37, 172.
Cyclists' Feast, The, 2, 148.
Dairyman, The Honest, 110, 235.
Definition, A Question of, 23, 163.
De Fonteney, 112.
Deified Puzzle, The, 74, 202.
De Morgan, A., 27.
De Tudor, Sir Edwyn, 12, 155.
Diabolique Magic Squares, 120.
Diamond Puzzle, The, 74, 202.
Dice, A Trick with, 116, 239. —— Game, The Montenegrin, 119, 242. —— Numbers, The, 17, 160.
Die, Painting the, 84, 210,
Digital Analysis, 157, 158. —— Division, 16, 158. —— Multiplication, 15, 156. —— Puzzles, 13.
Digits, Adding the, 16, 158. —— and Squares, 14, 155. —— Odd and Even, 14, 156.
Dilemma, An Amazing, 106, 233.
Diophantine Problem, 164.
Dissection Puzzle, An Easy, 35, 170. —— Puzzles, 27. —— —— Various, 35.
Dividing Magic Squares, 124.
Division, Digital, 16, 158. —— Simple, 23, 163.
Doctor's Query, The, 109, 235.
Dogs Puzzle, The Five, 92, 218.
Domestic Economy, 5, 151.
Domino Frame Puzzle, The, 114, 238.
Dominoes in Progression, 114, 237. —— The Eighteen, 123, 245. —— The Fifteen, 83, 209. —— The Five, 114, 238.
Donkey Riding, 13, 155.
Dormitory Puzzle, A, 81, 208.
Dovetailed Block, The, 145, 249.
Drayton's Polyolbion, 58.
Dungeon Puzzle, A, 97, 224.
Dungeons, The Siberian, 123, 244. —— The Spanish, 122, 244.
Dutchmen's Wives, The, 26, 167.
Dynamical Chess Puzzles, 96.
Earth's Girdle, The, 139.
Educational Times Reprints, 204.
Eggs, A Deal in, 3, 149. —— Obtaining the, 140.
Election, The Muddletown, 19, 161. —— The Parish Council, 19, 161.
Eleven, The Mystic, 16, 159.
Elopements, The Four, 113, 237.
Elrick, E., 231.
Engines, The Eight, 61, 194.
Episcopal Visitation, An, 98, 225.
Estate, Farmer Wurzel's, 51, 184.
Estates, The Yorkshire, 51, 183.
Euclid, 31, 138.
Euler, L., 165.
Exchange Puzzle, The, 66, 196.
Fallacy, A Chessboard, 141, 247.
Family Party, A, 8, 153.
Fare, The Passenger's, 13, 155.
Farmer and his Sheep, The, 22, 163.
Fence Problem, A, 21, 162.
Fences, The Landowner's, 42, 178.
Fermat, 164, 168.
Find the Man's Wife, 147, 251.
Fly on the Octahedron, The, 70, 198.
Fog, Mr. Gubbins in a, 18, 161.
Football Players, The, 116, 240.
Fraction, A Puzzling, 138.
Fractions, More Mixed, 16, 159.
Frame Puzzle, The Card, 114, 238. —— —— The Domino, 114, 238.
Frankenstein, E.N., 232.
Frenicle, B., 119, 168.
Frogs, The Educated, 59, 194- —— The Four, 103, 229. —— The Six, 59, 193.
Frost, A.H., 120.
Games, Puzzle, 117. —— Problems concerning, 114.
Garden, Lady Belinda's, 52, 186. —— Puzzle, The, 49, 182.
Gardener and the Cook, The, 146, 251.
Geometrical Problems, 27. —— Puzzles, Various, 49.
George and the Dragon, St., 101, 227.
Getting Upstairs, Such a, 143, 248.
Girdle, the Earth's, 139.
Goat, The Tethered, 53, 186.
Grand Lama's Problem, The, 86, 212.
Grasshopper Puzzle, The, 59, 193.
Greek Cross Puzzles, 28. —— —— Three from One, 169.
Greyhound Puzzle, The, 101, 227.
Grocer and Draper, The, 5, 151.
Gros, L., 248.
Group Problems, Combination and, 76.
Groups, The Three, 14, 156.
Hairdresser's Puzzle, The, 137.
Halfpennies, Placing, 147, 251.
Hampton Court Maze solved, 133.
Hannah's Puzzle, 75, 202.
Hastings, The Battle of, 23, 164.
Hatfield Maze solved, 136.
Hat Puzzle, The, 67, 196.
Hat-peg Puzzle, The, 93, 221.
Hats, The Wrong, 78, 203.
Hay, The Trusses of, 18, 161.
Heads or Tails, 22, 163.
Hearthrug, Mrs. Hobson's, 37, 172.
Helmholtz, Von, 41.
Honey, The Barrels of, 111, 236.
Honeycomb Puzzle, The, 75, 202.
Horse Race Puzzle, The, 117, 240.
Horseshoes, The Two, 40, 175.
Hydroplane Question, The, 12, 155.
Hymn-board Poser, The, 145, 250.
Icosahedron Puzzle, The, 70, 198.
Jack and the Beanstalk, 145, 249.
Jackson, John, 56.
Jaenisch, C.F. de, 92.
Jampots, Arranging the, 68, 197.
Jealous Husbands, Five, 113, 236.
Joiner's Problem, The, 36, 171. —— —— Another, 37, 171.
Jolly Gaol-Birds, Eight, 122, 243. —— —— Nine, 122, 243.
Journey, The Queen's, 100, 227. —— The Rook's, 96, 224.
Junior Clerks' Puzzle, The, 4, 150.
Juvenile Puzzle, A, 68, 197.
Kangaroos, The Four, 102, 228.
Kelvin, Lord, 41.
Kennel Puzzle, The, 105, 231.
King and the Castles, The, 56, 189. —— The Forsaken, 106, 232.
Kite-flying Puzzle, A, 54, 187.
Knight-guards, The, 95, 222.
Knights, King Arthur's, 77, 203. —— Tour, Magic, 127, 247. —— —— The Cubic, 103, 229. —— —— The Four, 103, 229.
Labosne, A., 25, 90, 216.
Labourer's Puzzle, The, 18, 160.
Ladies' Diary, 26.
Lagrange, J.L., 9.
Laisant, C.A., 76.
Lamp-posts, Painting the, 19, 161.
Leap Year, 155. —— —— Ladies, The, 19, 161.
Legacy, A Puzzling, 20, 161.
Legal Difficulty, A, 23, 163.
Le Plongeon, Dr., 29.
Letter Block Puzzle, The, 60, 194. —— Blocks, The Thirty-six, 91, 216. —— Puzzle, The Fifteen, 79, 205.
Level Puzzle, The, 74, 202.
Linoleum Cutting, 48, 181. —— Puzzle, Another, 49, 181.
Lion and the Man, The, 97, 224. —— Hunting, 94, 222.
Lions and Crowns, 85, 212. —— The Four, 88, 214.
Lockers Puzzle, The, 14, 156.
Locomotion and Speed Puzzles, 11.
Lodging-house Difficulty, A, 61, 194.
London and Wise, 131.
Loyd, Sam, 8, 43, 44, 98, 144, 232, 233.
Lucas, Edouard, 16, 76, 112, 121.
Luncheons, The City, 77, 203.
MacMahon, Major, 109.
Magic Knight's Tour, 127, 247. —— Square Problems, 119. —— —— Card, 123, 244. —— —— of Composites, 127, 246. —— —— of Primes, 125. —— —— of Two Degrees, 125, 245. —— —— Two New, 125, 245. —— Strips, 121, 243.
Magics, Subtracting, Multiplying, and Dividing, 124.
Maiden, The Languishing, 97, 224.
Mandarin's Puzzle, The, 103, 230. —— "T" Puzzle, The, 126, 246.
Marketing, Saturday, 27, 168.
Market Women, The, 3, 149.
Mary and Marmaduke, 7, 152.
Mary, How Old was, 8, 153.
Massacre of Innocents, 139.
Match Mystery, A, 118, 241. —— Puzzle, A New, 55, 188.
Mates, Thirty-six, 106, 233.
Mazes and how to thread Them, 127.
Measuring, Weighing, and Packing Puzzles, 109. —— Puzzle, New, 110, 235.
Meeting, The Suffragists', 19, 161.
Mellor, W.M.F., 242.
Menages, Probleme de, 76.
Mersenne, M., 168.
Mice, Catching the, 65, 196.
Milkmaid Puzzle, The, 50, 183.
Millionaire's Perplexity, The, 3, 149.
Mince Pies, The Twelve, 57, 191.
Mine, Inspecting a, 71, 199.
Miners' Holiday, The, 23, 163.
Miser, The Converted, 21, 162.
Mitre, Dissecting a, 35, 170.
Monad, The Great, 39, 174.
Money, A Queer Thing in, 2, 148. —— Boxes, The Puzzling, 3, 149. ——, Pocket, 3, 149. —— Puzzles, 1. —— Puzzle, A New, 2, 148. ——, Square, 3, 149.
Monist, The, 125.
Monk and the Bridges, The, 75, 202.
Monstrosity, The, 108, 234.
Montenegrin Dice Game, The, 119, 242.
Morris, Nine Men's, 58.
Mosaics, A Problem in, 90, 215.
Mother and Daughter, 7, 152.
Motor-car Race, The, 117, 240. —— Tour, The, 74, 201. —— Garage Puzzle, The, 62, 195.
Motorists, A Puzzle for, 73, 201.
Mouse-trap Puzzle, The, 80, 206.
Moving Counter Problems, 58.
Multiplication, Digital, 15, 156. —— Queer, 15, 157. —— Simple, 23, 163.
Multiplying Magic Squares, 124.
Muncey, J.N., 125.
Murray, Sir James, 44.
Napoleon, 43, 44.
Nasik Magic Squares, 120.
Neighbours, Next-Door, 8, 153.
Newton, Sir Isaac, 56.
Nine Men's Morris, 58.
Notation, Scales of, 149.
Noughts and Crosses, 58, 117.
Nouvelles Annales de Mathematiques, 14.
Number Checks Puzzle, The, 16, 158.
Numbers, Curious, 20, 162.
Nuts, The Bag of, 8, 153.
Observation, Defective, 4, 150.
Octahedron, The Fly on the, 70, 198.
Oval, How to draw an, 50, 182.
Ovid's Game, 58.
Packing in Russia, Gold, 111, 236. —— Puzzles, Measuring, Weighing, and, 109. —— Puzzle, A, 111, 236.
Pandiagonal Magic Squares, 120.
Papa's Puzzle, 53, 187.
Paradox Party, The, 137.
Party, A Family, 8, 153.
Patchwork Puzzles, 46. —— Puzzle, Another, 48, 180. —— The Silk, 34, 168.
Patience, Strand, 116, 239.
Pawns, A Puzzle with, 94, 222. —— Immovable, 106, 233. —— The Six, 107, 233. —— The Two, 105, 231.
Pearls, The Thirty-three, 18, 160.
Pebble Game, The, 117, 240.
Pedigree, A Mixed, 8, 153.
Pellian Equation, 164, 167.
Pennies, The Five, 143, 248. —— The Twelve, 65, 195.
Pension, Drawing her, 12, 155.
Pentagon and Square, The, 37, 172. —— Drawing a, 37.
Pfeffermann, M., 125.
Pheasant-Shooting, 146, 251.
Philadelphia Maze solved, 137.
Pierrot's Puzzle, The, 15, 156.
Pigs, The Seven, 41, 177.
Planck, C., 220, 246.
Plane Paradox, 138.
Plantation Puzzle, A, 57, 189. —— The Burmese, 58, 191.
Plates and Coins, 65, 195.
Plums, The Baskets of, 126, 245.
Poe, E.A., 249.
Points and Lines Problems, 56.
Postage Stamps, The Four, 84, 210.
Post-Office Perplexity, A, 1, 148.
Potato Puzzle, The, 41, 177.
Potatoes, The Basket of, 13, 155.
Precocious Baby, The, 139.
Presents, Buying, 2, 148.
Prime Magic Squares, 125.
Printer's Error, A, 20, 162.
Prisoners, Exercise for, 104, 230. —— The Ten, 62, 195.
Probabilities, Two Questions in, 5, 150.
Problems concerning Games, 114.
Puss in the Corner, 118, 240.
Puzzle Games, 117.
Pyramid, Painting a, 83, 208.
Pyramids, Square and Triangular, 167.
"Queen, The," 120.
Queens and Bishop Puzzle, 93, 219. —— The Eight, 89, 215.
Queen's Journey, The, 100, 227. —— Tour, The, 98, 225.
Quilt, Mrs. Perkins's, 47, 180.
Race Puzzle, The Horse-, 117, 240. —— The Motor-car, 117, 240.
Rackbrane's Little Loss, 21, 163.
Railway Muddle, A, 62, 194. —— Puzzle, A, 61, 194. —— Stations, The Three, 49, 182.
Rational Amusement for Winter Evenings, 56.
Rectangles, Counting the, 105, 232.
Reiss, M., 58.
Relationships, Queer, 8, 153.
Reversals, A Puzzle in, 5, 151.
River Axe, Crossing the, 112, 236.
River Problems, Crossing, 112.
Rookery, The, 105, 232.
Rook's Journey, The, 96, 224. —— Tour, The, 96, 223.
Rooks, The Eight, 88, 214. —— The Two, 117, 240.
Round Table, The, 80, 205.
Route Problems, Unicursal and, 68.
Ruby Brooch, The, 144, 249.
Sabbath Puzzle, The, 144, 249.
Sailor's Puzzle, The, 71, 199.
Sayles, H.A., 125.
Schoolboys, The Nine, 80, 205.
Schoolgirls, The Fifteen, 80, 204.
Scramble, The Great, 19, 161.
Sculptor's Problem, The, 23, 164.
Second Day of Week, 139.
See-Saw Puzzle, The, 22, 163.
Semi-Nasik Magic Squares, 120.
Senior and Junior, 140.
Sevens, The Four, 17, 160.
Sharp's Puzzle, 230.
Sheepfold, The, 52, 184.
Sheep Pens, The Six, 55, 189. —— The Sixteen, 80, 206. —— The Three, 92, 217. —— Those Fifteen, 77, 203.
Shopping Perplexity, A, 4, 150.
Shuldham, C.D., 125, 126.
Siberian Dungeons, The, 123, 244.
Simpleton, The Village, 11, 155.
Skater, The Scientific, 100, 226.
Skeat, Professor, 127.
Solitaire, Central, 63, 195. —— Chessboard, 108, 234. —— Counter, 107, 234.
Sons, The Four, 49, 181.
Spanish Dungeons, The, 122, 244. —— Miser, The, 24, 164.
Speed and Locomotion Puzzles, 11. —— Average, 11, 155.
Spiral, Drawing a, 50, 182.
Spot on the Table, The, 17, 160.
Square Numbers, Check for, 13. —— —— Digital, 16, 159. —— of Veneer, The, 39, 175. —— Puzzle, An Easy, 35, 170.
Squares, A Problem in, 23, 163. —— Circling the, 21, 162. —— Difference of Two, 167. —— Magic, 119. —— Sum of Two, 165, 175. —— The Chocolate, 35, 170.
Stalemate, 106, 232.
Stamp-licking, The Gentle Art of, 91, 217.
Star Puzzle, The, 99, 226.
Stars, The Eight, 89, 215. —— The Forty-nine, 100, 226.
Statical Chess Puzzles, 88.
Sticks, The Eight, 53, 186.
Stonemason's Problem, The, 25, 165.
Stop-watch, The, 11, 154.
Strand Magazine, The, 44, 116, 220.
Strand Patience, 116, 239.
Stream, Crossing the, 112, 236.
Strutt, Joseph, 59.
Subtracting Magic Squares, 124.
Sultan's Army, The, 25, 165.
Suppers, The New Year's Eve, 3, 149.
Surname, Find Ada's, 27, 168.
Swastika, The, 29, 31, 169.
"T" Card Puzzle, The, 115, 239.
Table, The Round, 80, 205.
Table-top and Stools, The, 38, 173.
Tangram Paradox, A, 43, 178.
Target, The Cross, 84, 210.
Tartaglia, 25, 109, 112.
Tea, Mixing the, 111, 235.
Telegraph Posts, The, 139.
Tennis Tournament, A, 78, 203.
Tetrahedron, Building the, 82, 208.
Thief, Catching the, 19, 161.
Thrift, A Study in, 25, 166.
Thompson, W.H., 232.
Ticket Puzzle, The Excursion, 5, 151.
Time Puzzle, A, 10, 153. —— What was the, 10, 153.
Tiring Irons, The, 142, 247.
Tit-Bits, 58, 79, 124, 251.
Torn Number, The, 20, 162.
Torpedo Practice, 67, 196.
Tour, The Cyclists', 71, 199. —— The Grand, 72, 200. —— The Queen's, 98, 225. —— The Rook's, 96, 223.
Towns, Visiting the, 70, 198.
Trains, The Two, 11, 155.
Treasure Boxes, The Nine, 24, 164.
Trees, The Twenty-one, 57, 190.
Tremaux, M., 133, 135.
Triangle, The Dissected, 38, 173.
Triangular Numbers, 13, 25, 166. —— —— Check for, 13.
Troublesome Eight, The, 121, 242.
Tube Inspector's Puzzle, The, 69, 198. —— Railway, Heard on the, 8, 153.
Turks and Russians, 58, 191.
Turnings, The Fifteen, 70, 198.
Twickenham Puzzle, The, 60, 194.
Two Pieces Problem, The, 96.
Unclassified Puzzles, 142.
Unicursal and Route Problems, 68.
Union Jack, The, 50, 69, 197.
Vandermonde, A., 58, 103.
Veil, Under the, 90, 216.
Verne, Jules, 249.
Victoria Cross Puzzle, The, 60, 194.
Village, A Wonderful, 142, 247.
Villages, The Three, 12, 155.
Villas, The Eight, 80, 206.
Vortex Rings, 40.
Voter's Puzzle, The, 75, 202.
Wall, The Puzzle, 52, 184.
Wallis, J., 142. —— (Another), 220.
Walls, The Garden, 52, 185.
Wapshaw's Wharf Mystery, The, 10, 153.
War Puzzle Game, The, 118, 240.
Wassail Bowl, The, 109, 235.
Watch, A Puzzling, 10, 153.
Water, Gas, and Electricity, 73, 200.
Weekly Dispatch, The, 28, 124, 125, 146, 148.
Weighing Puzzles, Measuring, Packing, and, 109.
Wheels, Concerning, 55, 188.
Who was First? 142, 247.
Whyte, W.T., 147.
Widow's Legacy, The, 2, 148.
Wife, Find the Man's, 147, 251.
Wilkinson, Rev. Mr., 193.
Wilson, Professor, 29.
Wilson's Poser, 9, 153.
Wine and Water, 110, 235. —— The Keg of, 110, 235.
Wotherspoon, G., 244.
Yacht race, The, 99, 226.
Youthful Precocity, 1, 148.