Analog Computing: Shortest Path

Inspired by Micah Scott’s recent tweets on analog computing and maze solvers, here is an analog computer that solves the shortest path between two points in multi-path maze. All you need are some LEDs and a current source!

References and additional reading:

Description Reference
Maze solving with helium gas Glow discharge in microfluidic chips for visible analog
, Darwin R. Reyes, Moustafa M. Ghanem, George M. Whitesides and Andreas Manz, Harvard University
Maze solving with hexyldecanoic acid Maze Solving Using Fatty Acid Chemistry, Kohta Suzuno, Istvan Lagzi, et al
Bob Pease on analog computers What’s All This Analog Computing Stuff, Anyhow?, The Bob Pease Show
Analog computing lecture High performance/low power computing based on the analog computing paradigm, Bernd Ulmann, SIGINT 2013
Classic text on analog computers Electronic Analog Computers, Granino & Theresa Korn

One thought on “Analog Computing: Shortest Path

Leave a Reply

Your email address will not be published. Required fields are marked *