Finally managed to solve shelf stacker: For Shelf Stacker (kanubem): defucyg
This setup would not have worked if I hadn't noticed that the dozers delay the crate stream by 1 tick when they return after delivering the crate, which was needed for the next dozer to pick the correct crate.
318 ticks: dataviz It should be possible to get a 317 tick solution if you can get the top left system to drop dozers in a d-d--- pattern instead of the current d--d-- pattern. If so you can get rid of the middle delay step gaining a tick.
Nice work for The Bus, here's my solution: beroxut
It's been a while since I made this solution but I think this is how it works: New crates are generated on a 20 tick cycle. On every cycle I first retrieve the value of the rightmost crate. At the end of the cycle, when the new crates arrive, I alternate between dropping F's on crate 1 and 3 and on crate 2 and 4. If either of the crates are F's the rightmost value is grabbed and stored in a circular buffer at the top left side of the machine. Since I check every second crate each cycle I can check all of the moving crates for F's every 2 cycles.
When all crates have been found and the buffer is full I deliver the contents of the buffer to the lower right and stop the crate cycle. Since the buffer crates will be 1 off from the target crates, the buffer includes a 1 crate which I use to correct the values. Finally I grab the last crate to end up on the rightmost matcher and subtract the buffer crates from this value, generating the final stream of crates under the matchers.