331.--THE SCIENTIFIC SKATER.
[Ill.u.s.tration]
It will be seen that this skater has marked on the ice sixty-four points or stars, and he proposes to start from his present position near the corner and enter every one of the points in fourteen straight lines. How will he do it? Of course there is no objection to his pa.s.sing over any point more than once, but his last straight stroke must bring him back to the position from which he started.
It is merely a matter of taking your pencil and starting from the spot on which the skater"s foot is at present resting, and striking out all the stars in fourteen continuous straight lines, returning to the point from which you set out.
332.--THE FORTY-NINE STARS.
[Ill.u.s.tration]
The puzzle in this case is simply to take your pencil and, starting from one black star, strike out all the stars in twelve straight strokes, ending at the other black star. It will be seen that the attempt shown in the ill.u.s.tration requires fifteen strokes. Can you do it in twelve? Every turning must be made on a star, and the lines must be parallel to the sides and diagonals of the square, as shown. In this case we are dealing with a chessboard of reduced dimensions, but only queen moves (without going outside the boundary as in the last case) are required.
333.--THE QUEEN"S JOURNEY.
[Ill.u.s.tration]
Place the queen on her own square, as shown in the ill.u.s.tration, and then try to discover the greatest distance that she can travel over the board in five queen"s moves without pa.s.sing over any square a second time. Mark the queen"s path on the board, and note carefully also that she must never cross her own track. It seems simple enough, but the reader may find that he has tripped.
334.--ST. GEORGE AND THE DRAGON.
[Ill.u.s.tration]
Here is a little puzzle on a reduced chessboard of forty-nine squares. St. George wishes to kill the dragon. Killing dragons was a well-known pastime of his, and, being a knight, it was only natural that he should desire to perform the feat in a series of knight"s moves. Can you show how, starting from that central square, he may visit once, and only once, every square of the board in a chain of chess knight"s moves, and end by capturing the dragon on his last move? Of course a variety of different ways are open to him, so try to discover a route that forms some pretty design when you have marked each successive leap by a straight line from square to square.
335.--FARMER LAWRENCE"S CORNFIELDS.
One of the most beautiful districts within easy distance of London for a summer ramble is that part of Buckinghamshire known as the Valley of the Chess--at least, it was a few years ago, before it was discovered by the speculative builder. At the beginning of the present century there lived, not far from Latimers, a worthy but eccentric farmer named Lawrence. One of his queer notions was that every person who lived near the banks of the river Chess ought to be in some way acquainted with the n.o.ble game of the same name, and in order to impress this fact on his men and his neighbours he adopted at times strange terminology. For example, when one of his ewes presented him with a lamb, he would say that it had "queened a p.a.w.n"; when he put up a new barn against the highway, he called it "castling on the king"s side"; and when he sent a man with a gun to keep his neighbour"s birds off his fields, he spoke of it as "attacking his opponent"s rooks." Everybody in the neighbourhood used to be amused at Farmer Lawrence"s little jokes, and one boy (the wag of the village) who got his ears pulled by the old gentleman for stealing his "chestnuts" went so far as to call him "a silly old chess-protector!"
One year he had a large square field divided into forty-nine square plots, as shown in the ill.u.s.tration. The white squares were sown with wheat and the black squares with barley. When the harvest time came round he gave orders that his men were first to cut the corn in the patch marked 1, and that each successive cutting should be exactly a knight"s move from the last one, the thirteenth cutting being in the patch marked 13, the twenty-fifth in the patch marked 25, the thirty-seventh in the one marked 37, and the last, or forty-ninth cutting, in the patch marked 49. This was too much for poor Hodge, and each day Farmer Lawrence had to go down to the field and show which piece had to be operated upon. But the problem will perhaps present no difficulty to my readers.
[Ill.u.s.tration]
336.--THE GREYHOUND PUZZLE.
In this puzzle the twenty kennels do not communicate with one another by doors, but are divided off by a low wall. The solitary occupant is the greyhound which lives in the kennel in the top left-hand corner. When he is allowed his liberty he has to obtain it by visiting every kennel once and only once in a series of knight"s moves, ending at the bottom right-hand corner, which is open to the world. The lines in the above diagram show one solution. The puzzle is to discover in how many different ways the greyhound may thus make his exit from his corner kennel.
[Ill.u.s.tration]
337.--THE FOUR KANGAROOS.
[Ill.u.s.tration]
In introducing a little Commonwealth problem, I must first explain that the diagram represents the sixty-four fields, all properly fenced off from one another, of an Australian settlement, though I need hardly say that our kith and kin "down under" always do set out their land in this methodical and exact manner. It will be seen that in every one of the four corners is a kangaroo. Why kangaroos have a marked preference for corner plots has never been satisfactorily explained, and it would be out of place to discuss the point here. I should also add that kangaroos, as is well known, always leap in what we call "knight"s moves." In fact, chess players would probably have adopted the better term "kangaroo"s move" had not chess been invented before kangaroos.
The puzzle is simply this. One morning each kangaroo went for his morning hop, and in sixteen consecutive knight"s leaps visited just fifteen different fields and jumped back to his corner. No field was visited by more than one of the kangaroos. The diagram shows how they arranged matters. What you are asked to do is to show how they might have performed the feat without any kangaroo ever crossing the horizontal line in the middle of the square that divides the board into two equal parts.
338.--THE BOARD IN COMPARTMENTS.
[Ill.u.s.tration]
We cannot divide the ordinary chessboard into four equal square compartments, and describe a complete tour, or even path, in each compartment. But we may divide it into four compartments, as in the ill.u.s.tration, two containing each twenty squares, and the other two each twelve squares, and so obtain an interesting puzzle. You are asked to describe a complete re-entrant tour on this board, starting where you like, but visiting every square in each successive compartment before pa.s.sing into another one, and making the final leap back to the square from which the knight set out. It is not difficult, but will be found very entertaining and not uninstructive.
Whether a re-entrant "tour" or a complete knight"s "path" is possible or not on a rectangular board of given dimensions depends not only on its dimensions, but also on its shape. A tour is obviously not possible on a board containing an odd number of cells, such as 5 by 5 or 7 by 7, for this reason: Every successive leap of the knight must be from a white square to a black and a black to a white alternately. But if there be an odd number of cells or squares there must be one more square of one colour than of the other, therefore the path must begin from a square of the colour that is in excess, and end on a similar colour, and as a knight"s move from one colour to a similar colour is impossible the path cannot be re-entrant. But a perfect tour may be made on a rectangular board of any dimensions provided the number of squares be even, and that the number of squares on one side be not less than 6 and on the other not less than 5. In other words, the smallest rectangular board on which a re-entrant tour is possible is one that is 6 by 5.
A complete knight"s path (not re-entrant) over all the squares of a board is never possible if there be only two squares on one side; nor is it possible on a square board of smaller dimensions than 5 by 5. So that on a board 4 by 4 we can neither describe a knight"s tour nor a complete knight"s path; we must leave one square unvisited. Yet on a board 4 by 3 (containing four squares fewer) a complete path may be described in sixteen different ways. It may interest the reader to discover all these. Every path that starts from and ends at different squares is here counted as a different solution, and even reverse routes are called different.
339.--THE FOUR KNIGHTS" TOURS.
[Ill.u.s.tration]
I will repeat that if a chessboard be cut into four equal parts, as indicated by the dark lines in the ill.u.s.tration, it is not possible to perform a knight"s tour, either re-entrant or not, on one of the parts. The best re-entrant attempt is shown, in which each knight has to trespa.s.s twice on other parts. The puzzle is to cut the board differently into four parts, each of the same size and shape, so that a re-entrant knight"s tour may be made on each part. Cuts along the dotted lines will not do, as the four central squares of the board would be either detached or hanging on by a mere thread.
340.--THE CUBIC KNIGHT"S TOUR.
Some few years ago I happened to read somewhere that Abnit Vandermonde, a clever mathematician, who was born in 1736 and died in 1793, had devoted a good deal of study to the question of knight"s tours. Beyond what may be gathered from a few fragmentary references, I am not aware of the exact nature or results of his investigations, but one thing attracted my attention, and that was the statement that he had proposed the question of a tour of the knight over the six surfaces of a cube, each surface being a chessboard. Whether he obtained a solution or not I do not know, but I have never seen one published. So I at once set to work to master this interesting problem. Perhaps the reader may like to attempt it.
341.--THE FOUR FROGS.
[Ill.u.s.tration]
In the ill.u.s.tration we have eight toadstools, with white frogs on 1 and 3 and black frogs on 6 and 8. The puzzle is to move one frog at a time, in any order, along one of the straight lines from toadstool to toadstool, until they have exchanged places, the white frogs being left on 6 and 8 and the black ones on 1 and 3. If you use four counters on a simple diagram, you will find this quite easy, but it is a little more puzzling to do it in only seven plays, any number of successive moves by one frog counting as one play. Of course, more than one frog cannot be on a toadstool at the same time.
342.--THE MANDARIN"S PUZZLE.
The following puzzle has an added interest from the circ.u.mstance that a correct solution of it secured for a certain young Chinaman the hand of his charming bride. The wealthiest mandarin within a radius of a hundred miles of Peking was Hi-Chum-Chop, and his beautiful daughter, Peeky-Bo, had innumerable admirers. One of her most ardent lovers was Winky-Hi, and when he asked the old mandarin for his consent to their marriage, Hi-Chum-Chop presented him with the following puzzle and promised his consent if the youth brought him the correct answer within a week. Winky-Hi, following a habit which obtains among certain solvers to this day, gave it to all his friends, and when he had compared their solutions he handed in the best one as his own. Luckily it was quite right. The mandarin thereupon fulfilled his promise. The fatted pup was killed for the wedding feast, and when Hi-Chum-Chop pa.s.sed Winky-Hi the liver wing all present knew that it was a token of eternal goodwill, in accordance with Chinese custom from time immemorial.
The mandarin had a table divided into twenty-five squares, as shown in the diagram. On each of twenty-four of these squares was placed a numbered counter, just as I have indicated. The puzzle is to get the counters in numerical order by moving them one at a time in what we call "knight"s moves." Counter 1 should be where 16 is, 2 where 11 is, 4 where 13 now is, and so on. It will be seen that all the counters on shaded squares are in their proper positions. Of course, two counters may never be on a square at the same time. Can you perform the feat in the fewest possible moves?
[Ill.u.s.tration]
In order to make the manner of moving perfectly clear I will point out that the first knight"s move can only be made by 1 or by 2 or by 10. Supposing 1 moves, then the next move must be by 23, 4, 8, or 21. As there is never more than one square vacant, the order in which the counters move may be written out as follows: 1--21--14--18--22, etc. A rough diagram should be made on a larger scale for practice, and numbered counters or pieces of cardboard used.
343.--EXERCISE FOR PRISONERS.
The following is the plan of the north wing of a certain gaol, showing the sixteen cells all communicating by open doorways. Fifteen prisoners were numbered and arranged in the cells as shown. They were allowed to change their cells as much as they liked, but if two prisoners were ever in the same cell together there was a severe punishment promised them.
[Ill.u.s.tration]
Now, in order to reduce their growing obesity, and to combine physical exercise with mental recreation, the prisoners decided, on the suggestion of one of their number who was interested in knight"s tours, to try to form themselves into a perfect knight"s path without breaking the prison regulations, and leaving the bottom right-hand corner cell vacant, as originally. The joke of the matter is that the arrangement at which they arrived was as follows:-- 8 3 12 1 11 14 9 6 4 7 2 13 15 10 5 The warders failed to detect the important fact that the men could not possibly get into this position without two of them having been at some time in the same cell together. Make the attempt with counters on a ruled diagram, and you will find that this is so. Otherwise the solution is correct enough, each member being, as required, a knight"s move from the preceding number, and the original corner cell vacant.
The puzzle is to start with the men placed as in the ill.u.s.tration and show how it might have been done in the fewest moves, while giving a complete rest to as many prisoners as possible.
As there is never more than one vacant cell for a man to enter, it is only necessary to write down the numbers of the men in the order in which they move. It is clear that very few men can be left throughout in their cells undisturbed, but I will leave the solver to discover just how many, as this is a very essential part of the puzzle.
344.--THE KENNEL PUZZLE.
[Ill.u.s.tration]
A man has twenty-five dog kennels all communicating with each other by doorways, as shown in the ill.u.s.tration. He wishes to arrange his twenty dogs so that they shall form a knight"s string from dog No. 1 to dog No. 20, the bottom row of five kennels to be left empty, as at present. This is to be done by moving one dog at a time into a vacant kennel. The dogs are well trained to obedience, and may be trusted to remain in the kennels in which they are placed, except that if two are placed in the same kennel together they will fight it out to the death. How is the puzzle to be solved in the fewest possible moves without two dogs ever being together?
345.--THE TWO p.a.w.nS.
[Ill.u.s.tration]
Here is a neat little puzzle in counting. In how many different ways may the two p.a.w.ns advance to the eighth square? You may move them in any order you like to form a different sequence. For example, you may move the Q R P (one or two squares) first, or the K R P first, or one p.a.w.n as far as you like before touching the other. Any sequence is permissible, only in this puzzle as soon as a p.a.w.n reaches the eighth square it is dead, and remains there unconverted. Can you count the number of different sequences? At first it will strike you as being very difficult, but I will show that it is really quite simple when properly attacked.
VARIOUS CHESS PUZZLES.
"Chesse-play is a good and wittie exercise of the minde for some kinde of men." Burton"s Anatomy of Melancholy.
346.--SETTING THE BOARD.
I have a single chessboard and a single set of chessmen. In how many different ways may the men be correctly set up for the beginning of a game? I find that most people slip at a particular point in making the calculation.
347.--COUNTING THE RECTANGLES.
Can you say correctly just how many squares and other rectangles the chessboard contains? In other words, in how great a number of different ways is it possible to indicate a square or other rectangle enclosed by lines that separate the squares of the board?
348.--THE ROOKERY.
[Ill.u.s.tration]
The White rooks cannot move outside the little square in which they are enclosed except on the final move, in giving checkmate. The puzzle is how to checkmate Black in the fewest possible moves with No. 8 rook, the other rooks being left in numerical order round the sides of their square with the break between 1 and 7.
349.--STALEMATE.
Some years ago the puzzle was proposed to construct an imaginary game of chess, in which White shall be stalemated in the fewest possible moves with all the thirty-two pieces on the board. Can you build up such a position in fewer than twenty moves?
350.--THE FORSAKEN KING.
[Ill.u.s.tration]
Set up the position shown in the diagram. Then the condition of the puzzle is--White to play and checkmate in six moves. Notwithstanding the complexities, I will show how the manner of play may be condensed into quite a few lines, merely stating here that the first two moves of White cannot be varied.
351.--THE CRUSADER.
The following is a prize puzzle propounded by me some years ago. Produce a game of chess which, after sixteen moves, shall leave White with all his sixteen men on their original squares and Black in possession of his king alone (not necessarily on his own square). White is then to force mate in three moves.
352.--IMMOVABLE p.a.w.nS.
Starting from the ordinary arrangement of the pieces as for a game, what is the smallest possible number of moves necessary in order to arrive at the following position? The moves for both sides must, of course, be played strictly in accordance with the rules of the game, though the result will necessarily be a very weird kind of chess.
[Ill.u.s.tration]
353.--THIRTY-SIX MATES.
[Ill.u.s.tration]
Place the remaining eight White pieces in such a position that White shall have the choice of thirty-six different mates on the move. Every move that checkmates and leaves a different position is a different mate. The pieces already placed must not be moved.
354.--AN AMAZING DILEMMA.
In a game of chess between Mr. Black and Mr. White, Black was in difficulties, and as usual was obliged to catch a train. So he proposed that White should complete the game in his absence on condition that no moves whatever should be made for Black, but only with the White pieces. Mr. White accepted, but to his dismay found it utterly impossible to win the game under such conditions. Try as he would, he could not checkmate his opponent. On which square did Mr. Black leave his king? The other pieces are in their proper positions in the diagram. White may leave Black in check as often as he likes, for it makes no difference, as he can never arrive at a checkmate position.
[Ill.u.s.tration]
355.--CHECKMATE!
[Ill.u.s.tration]
Strolling into one of the rooms of a London club, I noticed a position left by two players who had gone. This position is shown in the diagram. It is evident that White has checkmated Black. But how did he do it? That is the puzzle.
356.--QUEER CHESS.
Can you place two White rooks and a White knight on the board so that the Black king (who must be on one of the four squares in the middle of the board) shall be in check with no possible move open to him? "In other words," the reader will say, "the king is to be shown checkmated." Well, you can use the term if you wish, though I intentionally do not employ it myself. The mere fact that there is no White king on the board would be a sufficient reason for my not doing so.
357.--ANCIENT CHINESE PUZZLE.
[Ill.u.s.tration]
My next puzzle is supposed to be Chinese, many hundreds of years old, and never fails to interest. White to play and mate, moving each of the three pieces once, and once only.
358.--THE SIX p.a.w.nS.
In how many different ways may I place six p.a.w.ns on the chessboard so that there shall be an even number of unoccupied squares in every row and every column? We are not here considering the diagonals at all, and every different six squares occupied makes a different solution, so we have not to exclude reversals or reflections.
359.--COUNTER SOLITAIRE.
Here is a little game of solitaire that is quite easy, but not so easy as to be uninteresting. You can either rule out the squares on a sheet of cardboard or paper, or you can use a portion of your chessboard. I have shown numbered counters in the ill.u.s.tration so as to make the solution easy and intelligible to all, but chess p.a.w.ns or draughts will serve just as well in practice.
[Ill.u.s.tration]
The puzzle is to remove all the counters except one, and this one that is left must be No. 1. You remove a counter by jumping over another counter to the next s.p.a.ce beyond, if that square is vacant, but you cannot make a leap in a diagonal direction. The following moves will make the play quite clear: 1-9, 2-10, 1-2, and so on. Here 1 jumps over 9, and you remove 9 from the board; then 2 jumps over 10, and you remove 10; then 1 jumps over 2, and you remove 2. Every move is thus a capture, until the last capture of all is made by No. 1.
360.--CHESSBOARD SOLITAIRE.
[Ill.u.s.tration]
Here is an extension of the last game of solitaire. All you need is a chessboard and the thirty-two pieces, or the same number of draughts or counters. In the ill.u.s.tration numbered counters are used. The puzzle is to remove all the counters except two, and these two must have originally been on the same side of the board; that is, the two left must either belong to the group 1 to 16 or to the other group, 17 to 32. You remove a counter by jumping over it with another counter to the next square beyond, if that square is vacant, but you cannot make a leap in a diagonal direction. The following moves will make the play quite clear: 3-11, 4-12, 3-4, 13-3. Here 3 jumps over 11, and you remove 11; 4 jumps over 12, and you remove 12; and so on. It will be found a fascinating little game of patience, and the solution requires the exercise of some ingenuity.
361.--THE MONSTROSITY.
One Christmas Eve I was travelling by rail to a little place in one of the southern counties. The compartment was very full, and the pa.s.sengers were wedged in very tightly. My neighbour in one of the corner seats was closely studying a position set up on one of those little folding chessboards that can be carried conveniently in the pocket, and I could scarcely avoid looking at it myself. Here is the position:-- [Ill.u.s.tration]
My fellow-pa.s.senger suddenly turned his head and caught the look of bewilderment on my face.
"Do you play chess?" he asked.