Skip to main content

Timeline for Swapping 3 knights in a 4x4 grid

Current License: CC BY-SA 4.0

3 events
when toggle format what by license comment
Mar 28, 2021 at 18:26 comment added Misha Lavrov I think looking at this graph does give us a good way to find a solution. After c5-b7, a8-b6, b7-d8, b8-d7, there's nothing stopping green from making the moves a5-c6 and b5-a7 while red does something time-wasting like b6-d5-b6. At this point, green's pieces are n the top right of the graph (a7, c6, d8) while red's pieces are in the bottom left (a8,b6,d7). We can then move both sets of pieces around the external cycle a8-b6-d7-c5-b7-d8-c6-a7-b5-c7-a8 until they swap places, and finally, reverse the initial set of moves. This is not optimal, but it does get us there.
S Mar 28, 2021 at 14:49 history answered justhalf CC BY-SA 4.0
S Mar 28, 2021 at 14:49 history made wiki Post Made Community Wiki by justhalf