## Monday, June 30, 2008

### The Two Trains

Two trains start at the same time, one from London to Liverpool, the other from Liverpool to London. If they arrive at their destinations one hour and four hours respectively after passing one another, how much faster is one train running than the other?

Solution

## Sunday, June 29, 2008

### A Time Puzzle

Solution

## Saturday, June 28, 2008

### Concerning Tommy's Age

This was all the information that the teacher could get out of Tommy Smart. Could you have told, from these facts, what was his precise age? It is certainly a little puzzling.

Solution

## Friday, June 27, 2008

### Defective Observation

Solution

## Thursday, June 26, 2008

### The Bicycle Thief

Solution

## Wednesday, June 25, 2008

### The Market Women

Solution

## Tuesday, June 24, 2008

### Indiscriminate Charity

Solution

## Monday, June 23, 2008

### Who was First?

It seems that Anderson only heard the report of the gun, Biggs only saw the smoke, and Carpenter merely saw the bullet strike the water near them. Now, the question arises: Which of them first knew of the discharge of the rifle?

Solution

## Sunday, June 22, 2008

### The Dovetailed Block

## Saturday, June 21, 2008

### The Siberian Dungeons

Show, in the fewest possible moves, how the sixteen men may form themselves into a magic square, so that the numbers on their backs shall add up the same in each of the four columns, four rows, and two diagonals without two prisoners having been at any time in the same cell together. I had better say, for the information of those who have not yet been made acquainted with these places, that it is a peculiarity of prisons that you are not allowed to go outside their walls. Any prisoner may go any distance that is possible in a single move.

## Friday, June 20, 2008

### Crossing the River Axe

## Thursday, June 19, 2008

### Puss in the Corner

A moves from 55 to 52; B moves from 6 to 13; A advances to 23; B goes to 15; A retreats to 26; B retreats to 13; A advances to 21; B retreats to 2; A advances to 7; B goes to 3; A moves to 6; B must now go to 4; A establishes himself at 11, and B must be captured next move because he is compelled to cross a line on which A stands. Play this over and you will understand the game directly. Now, the puzzle part of the game is this: Which player should win, and how many moves are necessary?

## Wednesday, June 18, 2008

### Card Triangles

If you simply turn the cards round so that one of the other two sides is nearest to you this will not count as different, for the order will be the same. Also, if you make the 4, 9, 5 change places with the 7, 3, 8, and at the same time exchange the 1 and the 6, it will not be different. But if you only change the 1 and the 6 it will be different, because the order round the triangle is not the same. This explanation will prevent any doubt arising as to the conditions.

## Tuesday, June 17, 2008

### The Barrel Puzzle

## Monday, June 16, 2008

### An Amazing Dilemma

## Sunday, June 15, 2008

### The Kennal Puzzle

Solution is here

## Saturday, June 14, 2008

### St. George and the Dragon

## Friday, June 13, 2008

### The Lion and the Man

The man visited every cell once and only once in the fewest possible straight lines until he reached the lion's cell. The lion, curiously enough, also visited every cell once and only once in the fewest possible straight lines until he finally reached the man's cell. They started together and went at the same speed; yet, although they occasionally got glimpses of one another, they never once met. The puzzle is to show the route that each happened to take.

## Thursday, June 12, 2008

### The Southern Cross

In rearranging the Planets, each of the five may be moved once in a straight line, in either of the three directions mentioned. They will, of course, obscure five other Stars in place of those at present covered.

## Wednesday, June 11, 2008

### The Bachet's Square

Note "row of four cards," so that the only diagonals we have here to consider are the two long ones

Solution

## Tuesday, June 10, 2008

### The Chessboard Sentence

I once set myself the amusing task of so dissecting an ordinary chessboard into letters of the alphabet that they would form a complete sentence. It will be seen from the illustration that the pieces assembled give the sentence, "CUT THY LIFE," with the stops between. The ideal sentence would, of course, have only one full stop, but that I did not succeed in obtaining.

The sentence is an appeal to the transgressor to cut himself adrift from the evil life he is living. Can you fit these pieces together to form a perfect chessboard?

## Monday, June 9, 2008

### The Cross Target

## Sunday, June 8, 2008

### The Mouse-Trap Puzzle

This is a modern version, with a difference, of an old puzzle of the same name. Number twenty-one cards, 1, 2, 3, etc., up to 21, and place them in a circle in the particular order shown in the illustration. These cards represent mice. You start from any card, calling that card "one," and count, "one, two, three," etc., in a clockwise direction, and when your count agrees with the number on the card, you have made a "catch," and you remove the card. Then start at the next card, calling that "one," and try again to make another "catch." And so on. Supposing you start at 18, calling that card "one," your first "catch" will be 19. Remove 19 and your next "catch" is 10. Remove 10 and your next "catch" is 1. Remove the 1, and if you count up to 21 (you must never go beyond), you cannot make another "catch." Now, the ideal is to "catch" all the twenty-one mice, but this is not here possible, and if it were it would merely require twenty-one different trials, at the most, to succeed. But the reader may make any two cards change places before he begins. Thus, you can change the 6 with the 2, or the 7 with the 11, or any other pair. This can be done in several ways so as to enable you to "catch" all the twenty-one mice, if you then start at the right place. You may never pass over a "catch"; you must always remove the card and start afresh.

Solution

## Saturday, June 7, 2008

### The City Luncheons

(A B) (C D) (E F) (G H) (I J) (K L).

Then give any pairing you like for the next day, say—

(A C) (B D) (E G) (F H) (I K) (J L),

and so on, until you have completed your eleven lines, with no pair ever occurring twice. There are a good many different arrangements possible. Try to find one of them.

Solutions

## Friday, June 6, 2008

### The Motor-Car Tour

Solution

## Thursday, June 5, 2008

### The Fifteen Turnings

Solution

## Wednesday, June 4, 2008

### The Exchange Puzzle

A B C D

E F G H

I J K L

It cannot be done in fewer moves. The puzzle is really much easier than it looks, if properly attacked.

## Tuesday, June 3, 2008

### The Motor-Garage Puzzle

The illustration represents the plan of a motor garage, with accommodation for twelve cars. But the premises are so inconveniently restricted that the proprietor is often caused considerable perplexity. Suppose, for example, that the eight cars numbered 1 to 8 are in the positions shown, how are they to be shifted in the quickest possible way so that 1, 2, 3, and 4 shall change places with 5, 6, 7, and 8—that is, with the numbers still running from left to right, as at present, but the top row exchanged with the bottom row? What are the fewest possible moves?

One car moves at a time, and any distance counts as one move. To prevent misunderstanding, the stopping-places are marked in squares, and only one car can be in a square at the same time.

## Monday, June 2, 2008

### The Six Frogs

## Sunday, June 1, 2008

### A new match Puzzle

In the illustration eighteen matches are shown arranged so that they enclose two spaces, one just twice as large as the other. Can you rearrange them (1) so as to enclose two four-sided spaces, one exactly three times as large as the other, and (2) so as to enclose two five-sided spaces, one exactly three times as large as the other? All the eighteen matches must be fairly used in each case; the two spaces must be quite detached, and there must be no loose ends or duplicated matches.