From StrategyWiki, the video game walkthrough and strategy guide wiki
Revision as of 07:21, 9 May 2024 by Henke37 (talk | contribs) (Actually useful description, scrap the junk files)
(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
First use NOT gates to provide inverse versions of all the inputs. Then use an AND gate for each output pin to detect the correct input combination for each pin.
Go to top
- 1 Bit Decoder
- 3 Bit Decoder
- Logic Engine
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: