A hexagonal maze

Hexagonal maze demo

Screenshot of hexmaze
FIGURE 1 Screenshot of the hexagonal maze

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 path between any two points.