Hexagonal maze

Hexagonal maze demo

Show figure 1 detailsClose figure 1 details×FIGURE 1

FIGURE 1

I implemented a hexagonal maze. It uses my friend Byron’s public domain visibility polygon library. The maze is generated using a randomized depth first search. The parent of each maze cell during this depth first traversal is stored in an array for efficient lookup of the path between any two points.