Before downloading the puzzle I spent a week trying to find an optimal encoding, researching topics like monotone gray codes, hypercube graphs, finite projective geometries, index functions on the power set... after all, this puzzle is not really about binary and senary arithmetic, but boolean algebra. Sadly, I couldn't find the sauce.

Instead, I use the "standard" encoding, but with the second digit shifted +1 modulo 6 (so that, e.g, Gold = 5 in the first digit and 0 in the second digit).  It would cost 1 cycle per tape loop for Arm 17 to pivot the molecule back into alignment for the standard encoding--hence the shift. The conversion algorithm has almost certainly been seen already, so I won't explain it here.

There are a number of weaknesses to my approach, but since they'll be obvious to those in the know, I'll instead highlight some things I'm proud of.

- Most arms have at least two jobs, with Arms 9, 11, 12 and 17 especially noteworthy.
- The passing of quicksilver waste through the 5-track river is cycle exact. A good example is test case 10011.
- 6P saves 2 area by storing waste from inputs 5 and 6 within active machinery, requiring unique programming. Managing this without impacting the cycle count took some real creativity. The things we do for a 3 point save... The full extent of the tomfoolery is best seen in test case 111111.

I really enjoyed this puzzle, and my first tournament in general. It has been a huge learning experience, and several of the puzzles have a special place in my heart. Thank you Haxton for all your hard work.