NP completeness

Didn’t understand the “encoded” reference, but i solved the level by logic.

I won the level before @Timothy Eugene's level.

Spoiler: My way

Wow, you need to push the slider as hard as you can to move the 3 stacked sliders and unlock the pillars.

Thanks for sharing @Meak

@Blue Tower .. i am not sure I fully understand your method but it seems different from mine

Spoiler: My way

select the height for each vertical draggable. The horizontal draggable can now easily be slid in to push B.

How this work

Easy but fun level...Thanks for sharing @Meak

A clever implementation.

Spoiler

The horizontal slider didn't move very smoothly for me. It seems to be the weight of the vertical sliders which makes it hard to move. Maybe its leading Metal Half Pillar could be rotated 90 degrees clockwise (seen from above) to make its movement easier.

I hope R achieves his sales target.

@Meak - It has been a long time since I learned about NP Completeness and satisfiability and I don't remember the details. Is there an (easy) way to explain how it relates to this level?

@MekaSage sure. This levels encodes the following satisfiability problem:

Spoiler: Encoding in SAT

(not a or b or not c or not d or e) and
(not b or not d) and
(b or c or not d or e) and
d and
(b or not d or not e)

It is known that these satisfiability formulas (is there an assignement such that the above evaluates to true?) is in general an NP-complete problem, meaning it's relatively easy to verify a solution, but it's hard to find one in general.
Fortunately, here, it's possible to solve it without brute forcing by looking at clauses in the order of an increasing number of inner terms.

That one took a while with some patience, trial and error and close scrutiny... but finally got it!

@Meak - somehow I missed your answer earlier. Thanks for explaining!