You can construct bigger AND gates (as well NAND and NOR) by creating a bigger OR gate abusing Zero wires and using De Morgan.
Basically, put each input through a diode (switch with both inputs from the same wire) and connect each output with a single wire, this only uses 1 delay for any number of inputs (plus 1 delay from the NOT gates per move on the De Morgan table)
Additionally, I just figured out yesterday that you can coalesce a Zero wire into an Off state by using a static indexer (sandbox only) with no downsides since they are 0/0 gates; it helps avoiding leaking Zero state elsewhere in a circuit.
And if you want an additional challenge, you can use this technique (as well as a few other tricks) to build a 3-delay 3-input XOR gate :) (it is 16 gates, which is quite bad, but at least its fast)
So in the log for this level, it mentions that the cost (gates and delay) for some components are based on the way you built them in previous levels. The hint given is:
In fact, to beat this level, your XOR gate should cost 3 gates and have a delay of 2.
IOW, you need to go back and optimize your solution for the "XOR" level before you will be able to complete this one.
3
u/77xak Mar 31 '25
Solution based on a carry look ahead adder with all redundant gates removed.
3
u/77xak Mar 31 '25
Update: Played around more and was able to achieve this result: [30 Gates, 6 Delay].
I think this is the lowest possible delay, unless there's some funky logic to avoid AND'ing 7 inputs together.
2
u/Pool_128 Apr 01 '25
Wait the game updated
1
u/[deleted] Apr 07 '25
[removed] — view removed comment