Medx Silver/Gold mathematically impossible?

[zgrssd]

I do not think that with the given nodes anything past Bronce is mathematically possible.

I have 102 input elements and only 27/24 seconds to solve it.

Even if I could solve it with a single Decision Tree: Color, 102x0.3s is still 30.6 Seconds.

[SamuraiProgrammer]

I am struggling with this one as well. I have noticed, however, that the test ends when all three destinations get the requisite number of fills.

I suspect the answer has to do with that... still thinking!

[zgrssd]

Originally posted by SamuraiProgrammer:

I am struggling with this one as well. I have noticed, however, that the test ends when all three destinations get the requisite number of fills.

I suspect the answer has to do with that... still thinking!

At this moment I find it more likely they they made some mistake setting those numbers.

Could even be that they changed something (like in what order elements come out of the input side; what nodes/Upgrades are avalible when trying this) and forgot to update the number with their perfect formula.

[SamuraiProgrammer]

I have succeeded in getting gold.

HINT:
Notice that the top destination calls for more than the other two. Arrange things so that more pieces go there.

SOLUTION:


Source TO

(A) Decision Tree : Color (Blue/Red)

(A Blue) TO (B) Decision Tree : Color (Red/Blue)

(A Red) TO (C) Decision Tree : Color (Any/Any)

(B Red) TO Output at Top

(B Blue) TO Output at Middle

(C Top) TO Output at Top

(C Bottom) TO Output at Bottom

[zgrssd]

Originally posted by SamuraiProgrammer:

I have succeeded in getting gold.

HINT:
Notice that the top destination calls for more than the other two. Arrange things so that more pieces go there.

SOLUTION:


Source TO

(A) Decision Tree : Color (Blue/Red)

(A Blue) TO (B) Decision Tree : Color (Red/Blue)

(A Red) TO (C) Decision Tree : Color (Any/Any)

(B Red) TO Output at Top

(B Blue) TO Output at Middle

(C Top) TO Output at Top

(C Bottom) TO Output at Bottom

Okay, that solution works. Now the next question: Why does it work?

It seems like this only happens because of some hidden thing, like the exact order in wich Elements come from output.
Wich does not seem to follow any discernible pattern, so it is trial and error.

[SamuraiProgrammer]

Well, I am not sure that is true. It is not something I considered when solving this puzzle.

I realize that the order the data is provided could have an impact on a puzzle's time to finish, but it is my tentative opinion that proper ordering of the components will preclude that being a factor.

MORE THAN A HINT AND NEARLY A SOLUTION:
I made sure that the output requiring the most pieces had two inputs. This was the key (at least for me).
In this particular puzzle, if you use three components (as suggested by the limit at the top), you will have four outputs and only three destinations. One of the destinations will have two. In prior iterations, the top destination was always the last to fill. Arranging things so that it had the extra input made the difference.

[Brawndo (The Thirst Mutilator)]

I got Gold, but it's super fiddly. You're not so much solving the puzzle as exactly balancing things to match the ratios of the outputs. I wasn't particularly happy with this puzzle as a result, it felt kind of meaningless.

[Vardis]

The number of elements in the inputs isn't relevant. I suspect they just have that many for inefficient designs so people can actually finish.

The necessary design here is pretty straightforward. You need all the blues to go to the center output. If some greens are mixed in, that's fine.

There are a few different designs that work (at least three), so just try to balance the outputs so they accumulate evenly, as that obviously means you finish faster since you need all three to be done.

[Lumi]

Even with the solution I always get 24,3s, too slow for the gold. What's up with that?

[Lumi]

Finally got it:

Hint 1: try to isolate the blue colour and lead it to the centre node and add just a little green to it.

Hint 2: Using a node with any/colour remove just a fraction of the colour on the colour output.

Solution: Node A (R/B) - Node B (any/G) - Node C (B/G) / Connections: A (R) to B - A (B) to C - B (any) to TOP - B (G) to MID - C (B) to MID - C (G) to BOTTOM

[ThemePark]

I've had a ton of problems with this one too, having the basic setup down, and trying to change the colours and final paths, and having no luck.

Oddly enough Lumi's solution didn't work for me, giving me only Silver, while zgrssd's did, giving me Gold.

I do not understand why this level was never removed from the game, obviously being too finicky and broken.