Free puzzles / Question / Chessboard Problems
Bishops--Guarded.
Now, how many bishops are necessary in order that every square shall be
either occupied or attacked, and every bishop guarded by another bishop?
And how may they be placed?
Answer
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 of n squared squares 2n - 2
bishops (the maximum number) may always be placed in 2^n 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.