(Added infobox) |
(Added api details) |
||
(One intermediate revision by the same user not shown) | |||
Line 1: | Line 1: | ||
{{Header Nav|game=Turing Complete}} | {{Header Nav|game=Turing Complete}} | ||
{{ | {{Infobox level | ||
| section = Arithmetic | | section = Arithmetic | ||
| type = | | type = Component | ||
| prerequisite1 = 1 Bit Decoder | | prerequisite1 = 1 Bit Decoder | ||
| | | unlocks-level1 = Logic Engine | ||
| | | unlocks-level2 = Registers | ||
| | | unlocks-component1 = 3 Bit decoder | ||
| api-enum-id = decoder3 | |||
| api-enum-number = 33 | |||
}} | }} | ||
{{spoilerspage}} | {{spoilerspage}} | ||
The 3 bit decoder | The 3 bit decoder can be made by 8 AND gates and 3 NOT. | ||
{{spoiler|title=Solution|[[File:Solution_3_Bit_Decoder.png|frame|center]]}} | {{spoiler|title=Solution|[[File:Solution_3_Bit_Decoder.png|frame|center]]}} |
Latest revision as of 11:18, 22 August 2024
Section | Arithmetic |
---|---|
Type | Component |
Prerequisite | 1 Bit Decoder |
Unlocks | Logic Engine Registers |
3 Bit decoder | |
Scored | No |
API | decoder3 (33) |
The 3 bit decoder can be made by 8 AND gates and 3 NOT.
Solution
Another possible option is to use 8 AND gates and 3 1-bit decoders, tho again, this is just another of a host of possible alternatives.