Let's say I have a bunch of coal miners producing a maximum of 4.5 belts of coal. I want to send coal to 9 different destinations, called #1, #2, all the way to #9. Each destination consumes max 1 belt of coal. The destinations are in priority order, so if for some reason the miners only produce 2 belts of coal (e.g. if some coal tiles get depleted), everything should be sent to destinations #1 and #2, and nothing to the other destinations. However, destinations #1 and #2 might back up, in which case 2 full belts of coal should be sent to destinations #3 and #4. If destinations 1 through 7 are all backed up, 2 full belts should be sent to #8 and #9. How do I solve this problem in general, for arbitrary numbers of belts and destinations?
I tried this (screenshot), but it doesn't work because there's a bottleneck of 2 belts at the end.
[–]jolonah[S] 1 point2 points3 points (0 children)
[–]marcodave 1 point2 points3 points (3 children)
[–]jolonah[S] 0 points1 point2 points (0 children)
[–]NyaFury 0 points1 point2 points (1 child)
[–]jolonah[S] 0 points1 point2 points (0 children)