Install Steam
login
|
language
简体中文 (Simplified Chinese)
繁體中文 (Traditional Chinese)
日本語 (Japanese)
한국어 (Korean)
ไทย (Thai)
Български (Bulgarian)
Čeština (Czech)
Dansk (Danish)
Deutsch (German)
Español - España (Spanish - Spain)
Español - Latinoamérica (Spanish - Latin America)
Ελληνικά (Greek)
Français (French)
Italiano (Italian)
Bahasa Indonesia (Indonesian)
Magyar (Hungarian)
Nederlands (Dutch)
Norsk (Norwegian)
Polski (Polish)
Português (Portuguese - Portugal)
Português - Brasil (Portuguese - Brazil)
Română (Romanian)
Русский (Russian)
Suomi (Finnish)
Svenska (Swedish)
Türkçe (Turkish)
Tiếng Việt (Vietnamese)
Українська (Ukrainian)
Report a translation problem
For two of more of them to be high, there must be some pair where both are high. So you need an AND gate for every pair: and(x0,x1), and(x0,x2), and(x0,x3), and(x1,x2), and (x1,x3), and(x2,x3)
So if two or more inputs are high, at least one of those and() gates will have a high output. So just OR all of those outputs together (nest a bunch of OR gates if you need to), and that should be that.
However, you don't really need to *reuse* your solution here, because Double Trouble wants "at least two inputs" and Counting Gates will want (among other things) "two or three inputs, but not four"...
If you'd rather not throw around a few logic gates to make things easier, you're liable to lose your mind when you get to the stage "Logic Engine". Maybe.
Even if you stick to using AND and OR gates, you can do much better than 6 AND gates that then feed into OR gates.
Eg: AB + AC + AD on the surface looks like it requires three AND gates and one three-input OR gate, but can be rewritten as A(B + C + D) which now requires one AND gate and one three-input OR gate.