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
Solution1 by Ariel)
Ariel wrote:
"...which means we have reached a deadlock and there is no solution."
But didn't Eric, in the first comment to this problem, show that there *is* a solution to this problem?
TP
re: Solution1
