  Two structures A and B are n-equivalent if player II has a winning strategy
in the n-move Ehrenfeucht-Fraisse game on A and B. We extend earlier results
about n-equivalence for finite coloured linear orders, describing an algorithm
for reducing to canonical form under 2-equivalence, and concentrating on the
cases of 2 and 3 moves.
