Stuck on Logic Engine

[RoomBroom]

I can't seem to logically piece together how a Byte Splitter, Byte OR, Byte NOT and Byte MUX can be used to get OR NOR AND and NAND. It may be that it's quite late, I just wanted to make sure that this isn't a bug and that I'm not supposed to have more pieces available on this level.

Thanks!
Great work, I've completed all of the other available levels and love the concept so far!

[Stuffe]

It actually is possible! That said I am going to lift the component restrictions and just make this an achievement instead since too many people seem to get stuck

[RoomBroom]

Thanks, I'll keep trying with these parts

[katori•15]

Originally posted by Stuffe:

It actually is possible! That said I am going to lift the component restrictions and just make this an achievement instead since too many people seem to get stuck

It is the question and desired output. When I started, I just took the input 1 and input and tried to NAND together I did not know that they would be numbers. I could not figure how input 1 was ON and input 2 was OFF, thinking that was the first tick.
Now that I know the answer, not sure if just giving the numbers of input 1 and input 2 and desired output number. would be easier for people.

[Paladia_Mors]

Just an fyi, the switch in the bytes tab can be triggered by bytes as well as bits. this alone allowed me to figure out a diagram that worked for the achievement.

[uggie]

Originally posted by RoomBroom:

Thanks, I'll keep trying with these parts

Here's a hint:
What happens to the truth table if you negate the inputs of a gate?

[Elyandarin]

I came here to ask if I would need to string together a byte-AND, byte-NAND and byte-NOR manually, but it seems not.

Would have liked if there was more of a hint. Like, the alien saying "we have confiscated a few of your byte-gates just to see if you can figure out how to make do."
If the byte-maker is gone, too, that would also be a definite hint.

Also, since byte-or is simplest, it would be nice if that was the first test step.

[Elyandarin]

Yes, it's solvable. Figuring that out was fun.
Added my probably-sub-par solution in case someone needs it.

https://steamcommunity.com/sharedfiles/filedetails/?id=2622201472

[Lord Testosticles]

I don't think the puzzle needs to be nerfed necessarily. Leave it this hard but maybe provide a hint that NAND and AND can, in fact, be built from OR and NOT. So, the given operations can work, you just have to build up some of them. Also, there's something suspicious about the order of operations such that you can optimize the solution a "bit" if you, say, look at what the bits are really doing in the instruction. That's handy in the real world too as real opcodes do tend to be built in real structure in the bits.

[clankill3r]

I had the puzzle in one attempt. Only the cleaning up so the wires are organized more neatly is harder.