Generate mazes of different shapes and arbitrary sizes using graph theory
Generate mazes of different shapes and arbitrary sizes using graph theory
Update: Check out Samhan's typescript port you can run from the browser!
Generate mazes of different shapes and arbitrary sizes
Maze generator can create rectangular, hexagonal, honeycomb, circular, and triangular mazes. Maze generation can be done using Kruskal's algorithm, depth-first search, breadth-first search, loop-erased random walk or Prim's algorithm. Mazes can be rendered in svg or png format (using gnuplot as intermediate in the latter case).
Maze generator uses gnuplot (with a system call gnuplot) to render png mazes.
So make sure that gnuplot 5.0+ is installed with pngcairo terminal support
and is in the path if you wish to use png.
The code is written in C++ 11, you will need a not-too-ancient C++ compiler to build it.
cd src; make
…
The arcs in the circular mazes are plotted as parametric curves in gnuplot, and png can take quite long to render for large mazes.
No open issues yet, or sync has not completed.