abbasali1994/maze-maker

Visual representation of how search algorithm works

Maze solver

This repository contains the source code of a web page that can generate and solve mazes using several algorithms. You can also move the start and the finish or draw your own walls.

Summary

• Summary
• Features
• Tests
  • Maze generation algorithms
  • Pathfinding algorithms
• Credits

Features

• You can choose the pathfinding algorithm of the maze solver :

• You can move the start and the finish :

• You can also add and remove walls on the grid :

• But the program is also able to generate a maze and you can choose the algorithm :

• The Clear button allows you to clear the grid and the Start button runs the pathfinding algorithm

Tests

Maze generation algorithms

• Randomized Depth-First :

   

• Kruskal's Algorithm :

   

• Prim's Algorithm :

   

• Wilson's Algorithm (unbiased) :

   

• Aldous-Broder Algorithm (unbiased) :

   

• Recursive Division :

   

Pathfinding algorithms

• Breadth-First (Slow but gives the shortest path) :

   

• Bidirectional Breadth-First (A little less slow and gives the shortest path) :

   

• Greedy Best-First (Very fast but does not always give the shortest path) :

   

• Dijkstra (Slow but gives the shortest path) :

   

• A* (Fast and gives the shortest path) :

   

Credits

• Abbas Ali : Creator of the project.