w:c:strategywiki>Henke37 (Yet another basic gate) |
m (Use ON & OFF in truth table) |
||
| (6 intermediate revisions by 3 users not shown) | |||
| Line 3: | Line 3: | ||
This level has you create the OR Gate. | This level has you create the OR Gate. | ||
{| {{ | {| {{TruthTable}} | ||
|+ OR Gate Truth Table | |+ OR Gate Truth Table | ||
|- | |- | ||
! Input | ! Input 1 !! Input 2 !! Output | ||
|- | |- | ||
| | | {{Off t}}|| {{Off t}}|| {{Off t}} | ||
|- | |- | ||
| | | {{Off t}}|| {{On t}}|| {{On t}} | ||
|- | |- | ||
| | | {{On t}}|| {{Off t}}|| {{On t}} | ||
|- | |- | ||
| | | {{On t}}|| {{On t}}|| {{On t}} | ||
|} | |} | ||
To solve this level, place one NAND gate and put NOT gates on both of the inputs. | To solve this level, place one NAND gate and put NOT gates on both of the inputs. | ||
{{Footer Nav|game=Turing Complete|prevpage=|nextpage=}} | {{Footer Nav|game=Turing Complete|prevpage=NOR Gate|nextpage=AND Gate}} | ||
Latest revision as of 23:24, 1 September 2024
This level has you create the OR Gate.
| Input 1 | Input 2 | Output |
|---|---|---|
 0 |
0 |
0
|
0 |
 1 |
1
|
1 |
0 |
1
|
1 |
1 |
1
|
To solve this level, place one NAND gate and put NOT gates on both of the inputs.