From StrategyWiki, the video game walkthrough and strategy guide wiki
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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 time you have to create a byte version of the OR gate.
Bring out two byte splitters, eight OR gates and a byte maker. Then handle each bit independently.
Go to top
- Double the Number
- Byte OR
- Byte NOT
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: