Game 04

Maze Generator

Python Recursive DFS 2D Lists Sets Nested Functions Stack

⚠ The original uses curses for real-time keys — browsers can't do that. This version is turn-based: type w/a/s/d then Enter to move. Same maze, same algorithm, just press Enter each step.

← Back to Games
maze_generator.py

// Press ▶ Run — find your way from S to E

›

Concepts practiced

DFSiterative stack-based
2D Listsgrid as list of lists
SetsO(1) visited lookup
Closuresnested neighbors()
Tuplesposition as (r, c)
Game loopstate + input + render

Reflection

I built a maze generator and solver using recursive depth-first search, representing the maze as a 2D grid of walls and paths stored in nested lists. I learned how a stack-based DFS can carve out a perfect maze by tracking visited cells in a set and backtracking when no unvisited neighbours remain. The trickiest debugging moment came when porting it to the browser; the original used Python's curses library for real-time key input, which Skulpt can't support. I worked around it by switching to a turn-based input model where the player types a direction and presses Enter, keeping the maze logic identical while making it fully playable in the browser terminal.