Classic DFS-based algorithm. Creates long, winding corridors with high "river" factor. Highly biased but fast.
Minimum spanning tree approach. Creates mazes with many short dead ends and lower bias. More random feel.
Union-find based approach. Creates very uniform mazes with balanced distribution. Excellent for fair gameplay.
Loop-erased random walk. Generates perfectly unbiased mazes. Slower but produces highest quality results.