This maze has only one long passage which hits every grid cell without branching. The math term for this is a Hamiltonian path. The algorithm I used works by first finding a boring Hamiltonian path by just squiggling up and down like a lawnmower, then randomly squargling the path until it is sufficiently squiggly.











