It has sometimes been assumed that there are a great many different solutions. As a matter of fact, there are only three arrangements—not counting mere reversals and reflections as
 | An image should appear at this position in the text. To use the entire page scan as a placeholder, edit this page and replace "{{missing image}}" with "{{raw image|Amusements in mathematics.djvu/235}}". Otherwise, if you are able to provide the image then please do so. For guidance, see Wikisource:Image guidelines and Help:Adding images. |  |
different. Curiously enough, nobody seems ever to have hit on the following simple proof, or to have thought of dealing with the black and the white squares separately.
Seven knights can be placed on the board on white squares so as to attack every black square in two ways only. These are shown in Diagrams 1 and 2. Note that three knights occupy the same position in both arrangements. It is therefore clear that if we turn the board so that a black square shall be in the top left-hand
| An image should appear at this position in the text. To use the entire page scan as a placeholder, edit this page and replace "{{missing image}}" with "{{raw image|Amusements in mathematics.djvu/235}}". Otherwise, if you are able to provide the image then please do so. For guidance, see Wikisource:Image guidelines and Help:Adding images. | |
corner instead of a white, and place the knights in exactly the same positions, we shall have two similar ways of attacking all the white squares. I will assume the reader has made the two last described diagrams on transparent paper, and marked them 1a and 2a. Now, by placing the transparent Diagram 1a over 1 you will be able to obtain the solution in Diagram 3, by placing 2a over 2 you will get Diagram 4, and by placing 2a over 1 you will get Diagram 5.
| An image should appear at this position in the text. To use the entire page scan as a placeholder, edit this page and replace "{{missing image}}" with "{{raw image|Amusements in mathematics.djvu/235}}". Otherwise, if you are able to provide the image then please do so. For guidance, see Wikisource:Image guidelines and Help:Adding images. | |
You may now try all possible combinations of those two pairs of diagrams, but you will only get the three arrangements I have given, or their reversals and reflections. Therefore these three solutions are all that exist.
320.—THE ROOK'S TOUR.
The only possible minimum solutions are shown in the two diagrams, where it will be seen that only sixteen moves are required to perform the feat. Most people find it difficult to reduce the number of moves below seventeen.
