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 is a third and final round of Binary Racer, but this time the target value is displayed in hexadecimal.
The strategy this time is to take advantage of the fact that four bits equals one hex character. So you can focus on one half at a time.
Go to top
← Conditionals | Hex Racer | Delay →
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: