m (1 revision imported: Imported from https://strategywiki.org/) |
m (Gelthor moved page Turing Complete/Double Trouble to Level/Double Trouble without leaving a redirect) |
(No difference)
| |
Latest revision as of 20:52, 28 October 2023
This level asks you to build a circuit that outputs On if at least two of the inputs are On.
The solution for this level is the largest so far, requiring nine gates. As the level says, don't overthink it. So just have one And Gate for each possible combination of inputs, and join them together with Or Gates.
