A rectangular grid maze of size ( R \times C ) has ( R \times C ) nodes (cells) and up to ( 2RC - R - C ) potential edges (walls between adjacent cells). Removing walls to create a spanning tree yields a perfect maze.
~2 KB for adjacency + visited flags.
Fans often seek out mazemaze16 because their releases typically avoid the common pitfalls of independent file sharing, such as: mazemaze16