Introductions
Table of Contents
[WIP]
BASIC LOGIC
NAND Gate
Output : 1 1 1 0
NOT Gate
NOR Gate
OR Gate
AND Gate
Always On
Second Tick
XOR Gate
4 NAND = XOR
Complete the XOR level using ONLY 4 NAND gates and nothing else
Bigger OR Gate
Bigger AND Gate
XNOR Gate
ARITHMETIC
Double Trouble
Odd Number of Signals
Counting Signals
Half Adder
Double the Number
Full Adder
4 Component Full Adder
Complete the full adder level using only 4 blue components
Byte OR
[WIP]
Byte NOT
[WIP]
Adding Bytes
[WIP]
Negative Numbers
[WIP]
Switch
[WIP]
Signed Negator
[WIP]
Demux
[WIP]
Bigger Demux
[WIP]
One Way
[WIP]
MEMORY
Circular Dependency
[WIP]
Tangled Gates
[WIP]
Understanding the Flip Flop
[WIP]
Bit Inverter
[WIP]
Saving Gracefully
[WIP]
Input Selector
[WIP]
Saving Bytes
[WIP]
Little Box
[WIP]
Counter
[WIP]
CPU ARCHITECTURE
Logic Engine
Symmetric ALU
Complete the “Logic Engine” level using only components from the “BYTES” category
Arithmetic Engine
[WIP]
Registers
[WIP]
Component Factory
[WIP]
Decoder
[WIP]
Calculations
[WIP]
Conditions
Condition 6
Complete the level called “Conditions” using only 6 blue components
Program
[WIP]
Immediate Values
[WIP]
Turing Complete
[WIP]
PROGRAMMING
Masking Time
[WIP]
Calibrating Laser Cannons
[WIP]
Spacial Invasion
[WIP]
The Maze
[WIP]
CPU ARCHITECTURE 2
XOR
[WIP]
Byte Constant
[WIP]
Byte AND
[WIP]
Byte XOR
[WIP]
Equality
[WIP]
Less
[WIP]
Wide Instructions
[WIP]
Wire Spaghetti
[WIP]
Opcodes
[WIP]
Immediate Values
[WIP]
Conditionals
[WIP]
FUNCTIONS
Shift
[WIP]
The Lab
[WIP]
Delay
[WIP]
The Product of Nibbles
[WIP]
RAM
[WIP]
Divide
[WIP]
Stack
[WIP]
PUSH and POP
[WIP]
Functions
[WIP]
ASSEMBLY CHALLENGES
Planet Names
[WIP]
Tower of Radioactive Alloy
[WIP]
Unseen Fruit
[WIP]
Delicious Order
[WIP]
Water World
[WIP]
Robot Racing
[WIP]
AI Showdown
[WIP]
Dancing Machine
[WIP]
This is it guys!! I am sure that you will love Turing Puzzle Solution Guide that we have shared with you. We are always open to discussion and suggestions from you. Just let us what you thought about the guide in the comment section.
Also, we would like to thank aabbiknru. He is the one behind this wonderful guide.
