of six on the left-hand side of the hoard serve no purpose, except to protect those bishops that are on adjoining squares. Another solution would therefore be obtained by simply raising the upper one of these one square and placing the other a square lower down.
299.—BISHOPS IN CONVOCATION.
The fourteen bishops may be placed in 256 different ways. But every bishop must always be placed on one of the sides of the board—that is, somewhere on a row or file on the extreme edge. The puzzle, therefore, consists in counting the number of different ways that we can arrange the fourteen round the edge of the board without attack. This is not a difficult
 | 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/227}}". Otherwise, if you are able to provide the image then please do so. For guidance, see Wikisource:Image guidelines and Help:Adding images. |  |
matter. On a chessboard of squares bishops (the maximum number) may always be placed in ways without attacking. On an ordinary chessboard n would be 8; therefore 14 bishops may be placed in 256 different ways. It is rather curious that the general result should come out in so simple a form.
300.— THE EIGHT QUEENS.
| 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/227}}". Otherwise, if you are able to provide the image then please do so. For guidance, see Wikisource:Image guidelines and Help:Adding images. | |
The solution to this puzzle is shown in the diagram. It will be found that no queen attacks another, and also that no three queens are in a straight line in any oblique direction. This is the only arrangement out of the twelve fundamentally different ways of placing eight queens without attack that fulfils the last condition.
301.—THE EIGHT STARS.
The solution of this puzzle is shown in the first diagram. It is the only possible solution within the conditions stated. But if one of the eight stars had not already been placed as shown, there would then have been eight ways of arranging the stars according to this scheme, if we count reversals and reflections as different. If you turn this page round so that each side is in turn at the bottom, you will get the four reversals; and if you reflect each of these in a
| 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/227}}". Otherwise, if you are able to provide the image then please do so. For guidance, see Wikisource:Image guidelines and Help:Adding images. | |
mirror, you will get the four reflections. These are, therefore, merely eight aspects of one "fundamental solution." But without that first star being so placed, there is another fundamental solution, as shown in the second diagram. But this arrangement being in a way symmetrical, only produces four different aspects by reversal and reflection.
302.—A PROBLEM IN MOSAICS.
| V | Y | R | G | O | W | P | B |
| R | O | B | Y | P | V | G | W |
| B | W | O | G | R | V | ||
| P | G | V | W | R | B | O | Y |
| W | B | O | P | Y | G | V | R |
| G | R | Y | V | B | P | W | O |
| Y | V | G | R | W | O | B | P |
| O | P | W | B | V | R | Y | G |
The diagram shows how the tiles may be rearranged. As before, one yellow and one
