Home

An attempt to collect algorithms for maze creation, solving, and processing.

Design goals:

• algorithms should be clear (no bit twiddling, incomprehensible data structures, or C-like code.)
• code should be clean (Sun coding standard, decent architecture)
• code is split up between maze code and display code
• base data structures should be logical, should support the algorithms, should be extensible for future development

Initially, the plan was to port Daedalus , but its code is cryptic beyond belief, and simply reprogramming the algorithms turned out to be easier. Amazing Mazes is also not meant to be a monolithic application, but a small support library. It will have a GUI, but not as extensive as Daedalus. Many of the algorithms will be based on descriptions on the Astrolog site, and much of that text is used in the javadocs.