Correct!
Alex Y
Looks right to me. The obvious mirror image solution starting with D also works.
This becomes easy, even for large numbers of pieces (16 checkers of each color in 33 spaces) if you follow the principle of moving as close as possible to alternating colors (or digits/letters) until you have them completely alternating, then move as many of one type, then the other toward their objective.
Interesting observation of the squares. I wonder if the pattern of moves may help. Just listing the moved pieces, the solutions are:
1) 1A1
2) 1BA12BA2
3) 1CB123CBA123BA3
4) 1DC123DCBA1234DCBA234BA4
It looks like the number moves for n pieces per side is
3 moves of all n pieces at the middle of the solution, = 3n
At each end of the solutions, moves of 1+2+3+...+n-1 = (n-1)*n/2
So middle + 2 ends = 3n+(n-1)*n = n^2+2n = (n+1)^2-1, which when adding in the starting position is the same as your observation.
And I just did it with five alligator clips vs 5 paperclips, and got 36 positions, which I'll count as qed 