You have a 4×5 chess board as follows:
You can move the four bishops in any order (not necessarily alternating black and white), provided that no move puts a piece in danger of being captured by a bishop of the opposite color.
What is the fewest number of moves needed for the black and white bishops to exchange places?
(In reply to
re(2): A switch solution - maybe not the optimal one... by slsl)
My example has 18 moves. I am increasingly convinced that it is ideal. Alas, the proof escapes me...
|
|
Posted by Eric
on 2004-03-06 12:44:15 |
re(3): A switch solution - maybe not the optimal one...
