3D Mazes in Java
by James L. Dean
Java executables and source (48K)
Explore mines.
Here is an amazing fact. The number of mazes that can be composed of
l rows and m columns of square rooms where any two rooms are connected
by a single path is the same as the number of spanning trees in an
l x m rectangle. This number is given by Richard W. Kenyon, James G. Propp,
and David B. Wilson in
"Trees and Matchings" in the
The Electronic Journal of Combinatorics 7 (2000), #R25 as follows:
This number increases rapidly as the number of rows and number of columns increase.
You can reach me by e-mail at: [email protected]
This page was last updated on September 22, 2008.