Skip to content
Find the shortest path out of a generated random maze. Rendered with canvas, tested with Jasmine.
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
lib
spec
src Added solved maze screenshot Jun 23, 2012
.gitignore
Readme.md
index.html
main.css
maze.png
solution.png
specs.html
specs.png

Readme.md

Random maze generator/solver

Overview

This is just a simple random maze generator and solver I wrote for fun that gets drawn over a canvas on the page. It is fully written in JavaScript and tested with Jasmine.

Please feel free to fork and make comments/suggestions! Thanks!

Implementation details

Maze Generation

The maze is generated using a Graph structure and a recursive depht-first search algorithm. All graph nodes (cells) are connected by default. By connected, I mean there is a wall separating them in the maze. As we run the DFS algorithm to generate the maze, we start removing connections and store them in an array of removed edges in the Graph class.

The size and complexity of the maze can be configured setting different width/height for the canvas element and setting the horizCells and vertCells numbers in the Maze class.

Maze Solution

We're using the A * Search Algorithm to find the shortest path from the start to the end of the maze. We're assuming the start cell is always the top left one, and the end is the bottom right. You can change that, however, if you like.

Screenshots

maze

solved maze

specs

License

You are free to reuse and/or modify this code however you like. If you do so, please add a note referring to this original source and attribute the credits.

You can’t perform that action at this time.