Steam Community :: Guide :: State Machines -or- How to solve the maze with 2 gates

Store Page

Turing Complete

All Discussions Screenshots Artwork Broadcasts Videos News Guides Reviews

Turing Complete > Guides > UnsignedRobin's Guides

76 ratings

State Machines -or- How to solve the maze with 2 gates

By UnsignedRobin

This guide explains the concept of state machines and how they can be used to solve the maze level with only 2 gates.

Award

Created by

UnsignedRobin
Offline

Category: Gameplay Basics

Languages: English

Posted

Updated

31 Jul, 2022 @ 8:08am

28 Nov, 2023 @ 3:26pm

3,798	Unique Visitors
68	Current Favorites

Guide Index

Overview

This guide has been moved to the official Turing Complete wiki

Comments

This guide has been moved to the official Turing Complete wiki

⠀

Click here to visit this guide on the official wiki[turingcomplete.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 Comments

< >

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