maze

generators: DFS carves long winding corridors. prim's makes shorter dead-ends, more branching. kruskal's merges random edges — very uniform. wilson's guarantees a uniform-random spanning tree (slow start, worth the wait).

solvers: BFS guarantees the shortest path. DFS plunges deep first — fast but often suboptimal. A* uses manhattan distance as heuristic — optimal and usually faster than BFS.