From StrategyWiki, the video game walkthrough and strategy guide wiki
Jump to navigation
Jump to search
Table of Contents
Appendices
Basic Logic
- Crude Awakening
- NAND Gate
- NOT Gate
- NOR Gate
- OR Gate
- AND Gate
- Always On
- Second Tick
- XOR Gate
- Bigger OR Gate
- Bigger AND Gate
- XNOR Gate
Arithmetic
Memory
- Circular Dependency
- Delayed Lines
- Odd Ticks
- Bit Inverter
- Bit Switch
- Input Selector
- The bus
- Saving Gracefully
- Saving Bytes
- Little Box
- Counter
CPU Architecture
- Arithmetic Engine
- Registers
- Component Factory
- Instruction Decoder
- Calculations
- Program
- Conditions
- Immediate Values
- Turing Complete
Programming
CPU Architecture 2
- XOR
- Byte Constant
- Byte XOR
- Equality
- Unsigned Less
- Signed Less
- Wide Instructions
- Wire Spaghetti
- Opcodes
- Immediate Values
- Conditionals
Functions
Assembly Challenges
This level ask you to create a circuit that can save a single bit an indeterminate amount of time.
The level mentions the Delay Line component, so use it to store the state between ticks. Use a pair of switches to select the input to the Delay Line, either its own output or the new value to store.
Go to top
← The bus | Saving Gracefully | Saving Bytes →
Table of Contents
Appendices
Basic Logic
- Crude Awakening
- NAND Gate
- NOT Gate
- NOR Gate
- OR Gate
- AND Gate
- Always On
- Second Tick
- XOR Gate
- Bigger OR Gate
- Bigger AND Gate
- XNOR Gate
Arithmetic
Memory
- Circular Dependency
- Delayed Lines
- Odd Ticks
- Bit Inverter
- Bit Switch
- Input Selector
- The bus
- Saving Gracefully
- Saving Bytes
- Little Box
- Counter
CPU Architecture
- Arithmetic Engine
- Registers
- Component Factory
- Instruction Decoder
- Calculations
- Program
- Conditions
- Immediate Values
- Turing Complete
Programming
CPU Architecture 2
- XOR
- Byte Constant
- Byte XOR
- Equality
- Unsigned Less
- Signed Less
- Wide Instructions
- Wire Spaghetti
- Opcodes
- Immediate Values
- Conditionals
Functions
Assembly Challenges
Hidden category: