Amusements in Mathematics (PDF)

by Dudeney, Henry Ernest, 1857-1930

Available in 215 free installments

Owner:

View book

Email address:

Enter your email address above to start receiving your free daily installments.

Dripread will never disclose your email address to third parties.

298.?BISHOPS?GUARDED.? solution

picture377

This puzzle is quite easy if you first of all give it a little thought. You need only consider squares of one colour, for whatever can be done in the case of the white squares can always be repeated on the black, and they are here quite independent of one another. This equality, of course, is in consequence of the fact that the number of squares on an ordinary chessboard, sixty-four, is an even number. If a square chequered board has an odd number of squares, then there will always be one more square of one colour than of the other.

Ten bishops are necessary in order that every square shall be attacked and every bishop guarded by another bishop. I give one way of arranging them in the diagram. It will be noticed that the two central bishops in the group of six on the left-hand side of the board 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.

Pg215

299.?BISHOPS IN CONVOCATION.? solution

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 matter. On a chessboard ofn 2 squares 2n- 2 bishops (the maximum number) may always be placed in 2^ 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.? solution

picture378

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.?solution

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 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.

picture379

302

PROBLEM IN MOSAICS.? solution

The diagram shows how the tiles may be rearranged. As before, one yellow and one purple tile are Pg216 dispensed with. I will here point out that in the previous arrangement the yellow and purple tiles in the seventh row might have changed places, but no other arrangement was possible.

303.?UNDER THE VEIL.? solution

Some schemes give more diagonal readings of four letters than others, and we are at first tempted to favour these; but this is a false scent, because what you appear to gain in this direction you lose in others. Of course it immediately occurs to the solver that every LIVE or EVIL is worth twice as much as any other word, since it reads both ways and always counts as 2. This is an important consideration, though sometimes those arrangements that contain most readings of these two words are fruitless in other words, and we lose in the general count.

The above diagram is in accordance with the conditions requiring no letter to be in line with another similar letter, and it gives twenty readings of the five words?six horizontally, six vertically, four in the diagonals indicated by the arrows on the left, and four in the diagonals indicated by the arrows on the right. This is the maximum.