The main insight in many of these algorithms is that if you have a tree, there's exactly one path between any two leaves (assuming you don't pass over a branch twice). So if you just draw a random tree-like structure and make the entry and exit points of the maze leaves in the tree, then you have a valid maze with exactly one solution.