A 20 x 20 grid of nodes is created. Nodes are first connected to all neighboring nodes through edges. This yields an initial graph. To turn this graph into a proper maze, we must "remove" some edges to make the maze reasonably difficult.

To derive a maze from the graph, Prim's Algorithm is used to construct a random minimal spanning tree from the graph. A minimal spanning tree ensures that there is exactly one unique path between any two points in the graph. The start and end points are randomly selected.