Feel free to skip if any of these concepts have been explained already With berlo spinning, it takes a minimum of 8 half cycles for the reagent to see every element. This solution chooses to dupe AFFFFEEW off of berlo in those 8 half cycles. Then there are two steps to each half cycle: Step 1) The elements move along a queue of length 8 (the queue is just a series of duping one element to the element after from tail to head so it only progresses once a half cycle). Because we must store these 8 atoms of information, the atoms in the reagent responsible for this queue can't be overwritten at the end of the half cycle. For this solve, it means that once all AFFFFEEW enter the queue, they must be on the correct element. The choice of queue in this solve is shown below: 4xx2 35xx xx68 x1x7 Throwing our duped elements one by one into the queue yields: FxxE EFxx xxFA xWxF Which satisfies the condition that all elements need to be in the right place for the final product. Step 2) The easy part: you have all the elements in your queue, now you dupe them off the queue to where they need to go. At the end of the half cycle, it should look like: 4812 3581 1268 8127 Tabbing through this solve (from the start) shows you half cycles 2,4, and 6 of the operation, corresponding to queues FA345678, FFFA5678, and EFFFFA78 (half cycle 8 outputs so you can't see it). They look like the following, respectively: xxFA AxFF FxEA xxxF FxxF FFxE FAxx FFxx EFAx xFAx xFFx xEFx On subsequent runthroughs, the berlo starts in a different spot than initially, so it cycles through the wrong queues (WW345678, AWWW5678) before getting back to the correct one.