Here is a neat little puzzle in counting. In how many different ways may the two pawns 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 pawn as far as you like before touching the other. Any sequence is permissible, only in this puzzle as soon as a pawn 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.
Solutions: 1
Solutions: 1
This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this edition or online at http://www.gutenberg.org. If you are not located in the United States, you'll have to check the laws of the country where you are located before using this ebook.
