A NEW BISHOP'S PUZZLE

 

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.


主题:
组合数学 -> 组合几何学 组合数学 -> 图论 组合数学 -> 博弈论 逻辑学 -> 推理/逻辑 谜题和画谜
来源:
There are no comments yet.
Authentication required

You must log in to post a comment.

Log in