1. Observe Recursive Backtracker DFS constructing the maze grid. 2. Once generated, a BFS solver computes the absolute shortest path. 3. A light-runner particle traverses the computed corridor.
Maze Runner
SYS_NODE 135 // PROCEDURAL MAZE GENERATOR
SYS STATEGENERATING
GRID SIZE21 x 21
DFS STACK0
PATH NODES---
DFS BUILDCarves passages cell by cell with backtrackingMEASURING
BFS SEARCHScans adjacent cells breadth-first for the shortest pathWAITING
Solving labyrinths autonomously
Project 135
Atelier interactive artifact 135 module. This interactive module represents Digital Artifact inside the Atelier platform. Built using HTML5 and modern JavaScript for maximum performance and design fidelity.