Turing Complete

Turing Complete

80 betyg
State Machines -or- How to solve the maze with 2 gates
Av UnsignedRobin
This guide explains the concept of state machines and how they can be used to solve the maze level with only 2 gates.
9
11
3
5
2
2
3
2
   
Utmärkelse
Favorit
Favoritmarkerad
Avfavoritmarkerad
This guide has been moved to the official Turing Complete wiki





You can still post comments and share this site - i will read all of it
ᴹᵒᵛᵉᵈ ᵇᵉᶜᵃᵘˢᵉ ˢᵗᵉᵃᵐ ᵈᵉˡᵉᵗᵉˢ ᵖᶦᶜᵗᵘʳᵉˢ ᶦⁿ ʳᵃⁿᵈᵒᵐ ᶦⁿᵗᵉʳᵛᵃˡˢ ⁻ ᵐᵃᵏᶦⁿᵍ ᶦᵗ ᵛᵉʳʸ ʰᵃʳᵈ ᵗᵒ ᵏᵉᵉᵖ ᶦᵗ ᵘᵖ ᵗᵒ ᵈᵃᵗᵉ



What is this guide about
This guide explains how state machines work using The Maze level as an example. After our first state machine has been turned into a circuit, we do several iterations to improve our final circuit until we finally reach a 2 gate, 2 delay solution.

12 kommentarer
Phil B 19 aug @ 22:18 
Just when I think I'm starting to understand some of the concepts, I read this and realise I know nothing. Amazing write up!
Thiago 9 jul @ 18:05 
alien knowledge
BouncyKnight 28 mar, 2024 @ 16:05 
That's really a great deep dive into state machines, it covers basically everything that my studies on them in the uni did lol - it's really great, informative and expertly presented. Thank you for this :p2cube:
AtomicBlom 15 mar, 2024 @ 19:17 
Aliens: Prove you are intelligent by building a computer.
UnsignedRobin: One gate and a delay line.

This was an amazing read, thanks for making it!
McPixelator 23 aug, 2023 @ 12:23 
Holy moly, I can't believe the amount of detail in this guide. Absolute legend
Tanner07 24 apr, 2023 @ 9:44 
A two gate maze solver...this truly is an amazing find.
programaths 31 mar, 2023 @ 6:46 
Fantastic!!!!
Cosmo 2 jan, 2023 @ 13:11 
Damm this post is really sick, I would never, never expected that you can do it with only a nor and a delay line. In such a small space... :steamthumbsup:
Trobby 2 nov, 2022 @ 7:50 
Doormatt 1 sep, 2022 @ 16:20 
This is an amazing writeup.