Research

Maze Runner

Visual Algorithm for Solving Mazes

Georgia Institute of Technology
2019

Demo Video on Youtube:
Maze Runner

The visual algorithm of Maze Runner requires only one line of Shape Machine code, which is closing dead end recursively. “Closing dead end” is also commonly know as “dead end filling”, however, implementation of dead end filling in programming language is complex, since the problem is actually visual, instead of symbolic. This project is aiming to demonstrating that Shape Machine can be used for visual problem because the algorithms (especially visual ones), can be implemented in Shape Machine intuitively.