Graph-Based Approach: Each cell is a node, walls are edges. Creates minimum spanning tree.
Kruskal's Algorithm: Randomly removes walls while avoiding cycles using Union-Find data structure.
Perfect Maze Properties: Exactly one path between any two points, no loops, all cells connected.
Entry/Exit: Green start and red goal both on outer ring, opposite sides.