@mrsbeanbag the sequences above btw have both been generated by the same algorithm: we interpolate two permutations of a string by collecting all swaps that would correct a character, sort by cost of swap (where smaller distance is cheaper), then each iteration pick either the cheapest, the most expensive, or the median expensive transform from all options (i forgot which ones i took)