327.--A NEW BISHOP'S PUZZLE.

[Illustration:

+---+---+---+---+

| b | b | b | b |

+---+---+---+---+

| | | | |

+---+---+---+---+

| | | | |

+---+---+---+---+

| B | B | B | B |

+---+---+---+---+

]

This is quite a fascinating little puzzle. Place eight bishops (four

black and four white) on the reduced chessboard, as shown in the

illustration. The problem is to make the black bishops change places

with the white ones, no bishop ever attacking another of the opposite

colour. They must move alternately--first a white, then a black, then a

white, and so on. When you have succeeded in doing it at all, try to

find the fewest possible moves.

If you leave out the bishops standing on black squares, and only play on

the white squares, you will discover my last puzzle turned on its side.

Amusements in Mathematics · 第 386 / 970 题