Turing Complete

Turing Complete

76 rating
State Machines -or- How to solve the maze with 2 gates
Oleh 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
   
Penghargaan
Favorit
Difavoritkan
Batalkan favorit
This guide has been moved to the ♥♥♥♥♥♥♥♥ 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.

10 Komentar
Dave 28 Mar 2024 @ 4:05pm 
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 @ 7:17pm 
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 Agu 2023 @ 12:23pm 
Holy moly, I can't believe the amount of detail in this guide. Absolute legend
Tanner07 24 Apr 2023 @ 9:44am 
A two gate maze solver...this truly is an amazing find.
programaths 31 Mar 2023 @ 6:46am 
Fantastic!!!!
Cosmo 2 Jan 2023 @ 1:11pm 
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:50am 
Doormatt 1 Sep 2022 @ 4:20pm 
This is an amazing writeup.
fronders 17 Agu 2022 @ 10:48am 
... or is it?!

Hey VSauce :)
bakto2122 12 Agu 2022 @ 2:34pm 
this was really interesting & informative. thanks for writing it!