There are 2 white knights and 2 black knights positioned at a (
3 X 3) chess board. Find the minimum number of moves required to
replace the blacks with whites and the whites with blacks.
I tried the above in 19 steps and reckon that I'm wrong. Please help !!
I guess the catch here is to position the knights in
0 -> empty space |
w -> white knight |
b -> black knights
What is your take on this? Here is my solution, but it seems that my answer takes longer number of steps.
For some of those who still have some doubts regarding the question, the final configuration should be: