Level/3 Bit Decoder: Difference between revisions

From Turing Complete
m (3 revisions imported: Imported from https://strategywiki.org/)
(Added api details)
 
(4 intermediate revisions by the same user not shown)
Line 1: Line 1:
{{Header Nav|game=Turing Complete}}
{{Header Nav|game=Turing Complete}}
{{Infobox level
| section            = Arithmetic
| type                = Component
| 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}}


[[File:Turing Complete 3BD.png|frame|center]]
The 3 bit decoder can be made by 8 AND gates and 3 NOT.
The 3 bit decoder is made by 8 AND gates and 3 NOT.
 
{{spoiler|title=Solution|[[File:Solution_3_Bit_Decoder.png|frame|center]]}}


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.
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.


{{Footer Nav|game=Turing Complete|prevpage=1 Bit Decoder|nextpage=Logic Engine}}
{{Footer Nav|game=Turing Complete|prevpage=1 Bit Decoder|nextpage=Logic Engine}}

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)
spoilers
spoilers

Spoiler warning! This page contains spoilers, or hints about the game's storyline or progression.

You might want to skip to the next page if you do not want facts about the game's storyline or plot revealed to you.

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.