Maze Solving with a 2D Cellular Automaton

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

A simple cellular automaton is used to find a solution to mazes if one exists. The automaton calculates each cell's new value based on the surrounding cells in the previous time step. This makes dead-ends and branches of the maze die away until one path remains.

Contributed by: Alexander Varga (July 2012)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.