From StrategyWiki, the video game walkthrough and strategy guide wiki
< Turing Complete
Revision as of 20:09, 22 March 2024 by Henke37 (talk | contribs) (Set prev and next page)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

This level asks you to create a circut that shows the number of inputs that are On.

This level's solution is even bigger than the Double Trouble solution. You have to combine two previous level's solutions. First part is for odd number of inputs, Second part if for at least two input On, And last part checks if all inputs are On. We have also to check for the second part if all inputs are not On

As stated before use previous leve's soluitons. For even number of inputs use three XOR gates. To check if all inputs are On use three AND gates. And lastly for second part use Double Trouble solution. Also use AND gate for second part and negate third part outout to check if all inputs are the same, which will disable second part