ing 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 comer 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 I "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 20=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 |
| 2 | 2 | 2 | 2 |
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
