new ALU

[lavish wasp]

what are we thinkin chat

[woeful hemlock]

That it should be spoilered and in #1261310911428427806

But also there's a way to not need the decoder

[crisp quarry]

whaaaat? I first did it by using a bunch of ands and nots, I thought the decoder was the more compact way

[woeful hemlock]

Yep, there is. There's an achievement for not using any bit components as well

[crisp quarry]

I got the achievment for only using 8 bit components

do you mean that one?

but I still wouldnt know how to not use the 8 bit ors and nots

@woeful hemlock

[dry gyro]

Refresh your memory on ||De Morgan, in the in-game manual||.

[crisp quarry]

|| in Logic Unit I used de Morgan to construct the and gate with or and not, do you mean that? ||

[dry gyro]

That kind of technique, yes, I think the level only gives you NANDs (but I could be misremembering, it's been a while).

[marsh garden]

That level now gives you only Byte NAND-s in the [stable] release (word OR-s in the alpha).

[crisp quarry]

It gives you nand nor and 8 bit components

|| but isnt using the 3-bit decoder more efficent than the 8 bit or and not? ||

[marsh garden]

There might be a better way to utilise your gates:
||you can combine the de Morgan laws & discombobulating the Byte NEG component||,
||you can use MUX-es here for de Morgan LU, Byte NEG dissasembly & function selection||.
Although I haven't played on [stable] in a loooong time, so the circuit you have might be better score-wise.

[worldly totem]

Just glancing over this, Are you sure your supposed to be using neg-add for subtract? Shouldn't it be not-add?

[dry gyro]

Either can be used, provided ||the carry-in is correct||.

[worldly totem]

TIL, thanks.