Actually, throughput would be the correct terminology. I very much agree.

... This requires at most 31 steps: start with E = 0, M = chest content and T = 2^31 as long as T > 0: if M >= T * C: (subtract and compare EVERYTHING >= 0) M = M - T * C E += T T /= 2 ... That is for getting the quotients only, right? Or does (subtract and compare EVERYTHING >= 0) include getting ...

Tertius wrote: ↑

Sun Oct 31, 2021 7:06 pm

... It's even easier than I thought. It is a completely different approach to your approach. ...

My approach is the beginners approach, doing everything for each signal separately.

Tertius wrote: ↑

Sun Oct 31, 2021 3:35 pm

... Replace that division by a loop that does subtraktion, and count the number of loop iterations. ...

Would that mean, in the worst case of ingredient amount = 1 and 2.1 billion items in chest, that algo would loop 2.1 billion times?

I am not happy with the setup of my question. I think, next time I need to factor in the total amount of combinators required and the growth of latency (because of loops) at worst case and maybe some other characteristics which might be important.

Well, the minimum amount you can make out of any chest worth of stuff is 0. I think you mean the maximum. Yes, correct. With the previous wording I was referring to the minimum among the quotients, which could have been better. I updated the wording. Your challenge is a division, then calculate the...

I have a group of signals with their respective values set in a const combinator. These represent the items required to make 1 of item E. Let's call these signals r1, r2, r3, ... rn. I also have a chest with various items and I am reading its contents. Let's call the signals derived from that c1, c2...

To reduce train down time : build X number of parralel tracks 4 tile apart and park X number of train there. Then use pumps to make steam go through all of the train, wagon per wagon so that only the train in X position receive steam, when this X train is full it leaves the stations, and then the X...

I found a tillable pattern that alligns with reactor connection points at 70 tiles. (No surprise, as 70 is the least common multiple of 7 (6 wagon length + 1 gap) and 10 (2x5 reactor width) and where in a single wagon setup all connections could be made. Doesn't mean there aren't shorter ones. But t...

In a bottom up step, this is the one tillable pattern for a direct, 3 connection design I found: tillable hx2wagon setup 01.jpg Measuring the water throughput, it gave me a reliable 3k/s. ('writing "reliable", because in the upper row it is ~500/s higher ... which makes absolutely no sense...

That's kind of missing the challenge. ... The challenge for the contest is to transmit the heat along the train, not the steam. Sounds far too easy. ;) Edit: I am just joking. Also I meant in comparrison to my own pipe attempt, which addmitedly missed your specs and also just in response to daves t...

@DaveMcW: That seems to be the highly theoretical case, where one train can be loaded continuously while moving at max speed. Love that approach, because it leaves space for my engineering. Here is my unrequested attempt to transform it to ingame-reality: 1.) Needs S sibling stations + infrastructur...

viewtopic.php?f=7&t=3638

eg as in

viewtopic.php?f=7&t=100271

for the developers, small DLCV make bug fixing and possibly balancing (especially between new content and basic content) easier and smoother Quite the contrary is true. [*] the above also includes that players may move off to other games before the big DLC arrives and possibly not come back because...

... As such a train can do a U-turn by going through any of the stations, ... . If a train is west of the destination then it wants to go to the bottom stop. But if you only enable the top stop then it will move past the station, make a U-turn and go to the top stop. ... Ah yes, they can also go pa...

I don't think there is a solution to this problem. Wait, wait, wait, wait wait, ... . In my first solution I was focused on the example given by you. Two trains and not a problem if one of them moves slightly, before it actually can go to the target station. With the bigger picture of an arbitrary ...

Ok, I am down to 6 combinators and 4 ticks delay. 0eNrtXFtu4zYU3Ys+C3sgUiIpGpj+JLOBdj4KFANBsZmEqC0Zkpw2GHgB3Ue7sa6kevghS5R9buJk2qI/CRyZR+Q9vA8eXeWrd7fcmHVu09KbffXsPEsLb/bzV6+wD2myrP9WPq+NN/NsaVbexEuTVf0pT+zS2048my7Mb96Mbb9MPJOWtrSmHd98eI7TzerO5NUXTkZOd+gTb50V1ZgsrW9U4XD5QUy8Z282DfgHUeEvbG7m7Rf4djKA5...

As far as I understand it, the stuttering is a result of a feedback loop which is caused by the stations being input and output at the same time. What if you use two stations in each direction, all the same name (top1, top2 and bottom1, bottom2 instead of top and bottom). top1 and bottom1 are enable...