On the left, we have a board with 4 knights, where the white knights and black knights are separated vertically.
Using standard chess moves, is it possible to integrate the knights into the position on the right?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Based on the accessibility of the squares, we could form a cyclic path consisting of the squares from which one can move to another. The path can be labelled as follows so that consecutive numbers can be reached from one another (and 7 to 0 again):
Since the knights can never "pass up" each other on the loop, we can never switch the relative positioning of the knights.
Solution Courtsey: Algorithmic Puzzles and puzzling.stackexchange