by Dudeney, Henry Ernest, 1857-1930
Available in 215 free installments
Owner:
Where n = 9 there are 46 fundamental solutions. Where n = 10 there are 92 fundamental solutions. Where n = 11 there are 341 fundamental solutions.
Obviously n rooks may be placed without attack on an n 2 board in n! ways, but how many of these are fundamentally different I have only worked out in the four cases where n equals 2, 3, 4, and 5. The answers here are respectively 1,2,7, and 23. (See No. 296 . " The Four Lions .")
We can place 2n-2 bishops on an n 2 board in 2 n ways. (See No. 299 . " Bishops in Convocation .") For boards containing 2, 3, 4, 5, 6, 7, 8 squares, on a side there are respectively 1, 2, 3, 6, 10, 20, 36 fundamentally different arrangements. Where n is odd there are 2 1/2 ( n " 1 ) such arrangements, each giving 4 by reversals and reflections, and 2 n " 3 - 2 1/2 ( n " 3 ) giving 8. Where n is even there are 2 1/2 ( n " 2 ), each giving 4 by reversals and reflections, and 2 n " 3 - 2^ n ~ 4 \ each giving 8.
We can place 1 /4(n 2 +1) knights on an n 2 board without attack, when n is odd, in 1 fundamental way; and 1 /4n 2 knights on an n 2 board, when n is even, in 1 fundamental way. In the first case we place all the knights on the same colour as the central square; in the second case we place them all on black, or all on white, squares.
THE TWO PIECES PROBLEM.
On a board of n 2 squares, two queens, two rooks, two bishops, or two knights can always be placed, irrespective of attack or not, in 1 /4(n 4 - n 2 ) ways. The following formulae will show in how many of these ways the two pieces may be placed with attack and without:?
2 Queens
2 Rooks n3 - n2
2 Bishops
With Attack. Without Attack. 5n3 6n2 + n 3n4 - 10n3+ 9n2-2n 3 6
n4 - 2n3 + n2
2 4n3 - 6n2 + 2n 3n4 - 4n3 + 3n2 - 2n
2 Knights 4n2-12n + 8 (See No. 318, " Lion Hunting .")
6 6
n4 - 9n2 + 24n
DYNAMICAL CHESS PUZZLES.
"Push on?keep moving." THOS. MORTON: Cure for the Heartache.
320.?THE ROOK'S TOUR.
The puzzle is to move the single rook over the whole board, so that it shall visit every square of the board once, and only once, and end its tour on the square from which it starts. You have to do this in as few moves as possible, and unless you are very careful you will take just one move too many. Of course, a square is regarded equally as "visited" whether you merely pass over it or make it a stopping-place, and we will not quibble over the point whether the original square is actually visited twice. We will assume that it is not.
321.?THE ROOK'S JOURNEY
This puzzle I call "The Rook's Journey," because the word "tour" (derived from a turner's wheel) implies that we return to the point from which we set out, and we do not do this in the present case. We should not be satisfied with a personally conducted holiday tour that ended by leaving us, say, in the middle of the Sahara. The rook here makes twenty-one moves, in the course of which journey it visits every square of the board once and only once, stopping at the square marked 10 at the end of its tenth move, and ending at the square marked 21. Two consecutive moves cannot be made in the same direction?that is to say, you must make a turn after every move.
Pg97
322.?THE LANGUISHING MAIDEN.
A wicked baron in the good old days imprisoned an innocent maiden in one of the deepest dungeons beneath the castle moat. It will be seen from our illustration that there were sixty-three cells in the dungeon, all connected by open doors, and the maiden was chained in the cell in which she is shown. Now, a valiant knight, who loved the damsel, succeeded in rescuing her from the enemy. Having gained an entrance to the dungeon at the point where he is seen, he succeeded in reaching the maiden after entering every cell once and only once. Take your pencil and try to trace out such a route. When you have succeeded, then try to discover a route in twenty-two straight paths through the cells. It can be done in this number without entering any cell a second time.
323.?A DUNGEON PUZZLE.
~T?3 1 1?J [?r~
KHR-H + + +--HHFH
~* + + + + *H+!+ J
L t * ' - * r J
i i i LAJ ] L_
