Turing Complete

Turing Complete

Ocen: 76
State Machines -or- How to solve the maze with 2 gates
Autorstwa: 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
   
Przyznaj nagrodę
Ulubione
Ulubione
Usuń z ulubionych
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.

Komentarzy: 10
Dave 28 marca 2024 o 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 marca 2024 o 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 sierpnia 2023 o 12:23 
Holy moly, I can't believe the amount of detail in this guide. Absolute legend
Tanner07 24 kwietnia 2023 o 9:44 
A two gate maze solver...this truly is an amazing find.
programaths 31 marca 2023 o 6:46 
Fantastic!!!!
Cosmo 2 stycznia 2023 o 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 listopada 2022 o 7:50 
Doormatt 1 września 2022 o 16:20 
This is an amazing writeup.
fronders 17 sierpnia 2022 o 10:48 
... or is it?!

Hey VSauce :)
bakto2122 12 sierpnia 2022 o 14:34 
this was really interesting & informative. thanks for writing it!