https://github.com/stolsky/generate-and-solve-mazes
Visualization of the generation and solution of mazes with various algorithms.
https://github.com/stolsky/generate-and-solve-mazes
maze maze-algorithms maze-generation maze-solving simulation visualization
Last synced: 25 days ago
JSON representation
Visualization of the generation and solution of mazes with various algorithms.
- Host: GitHub
- URL: https://github.com/stolsky/generate-and-solve-mazes
- Owner: stolsky
- License: gpl-3.0
- Created: 2023-08-16T07:35:31.000Z (about 2 years ago)
- Default Branch: production
- Last Pushed: 2025-03-13T22:17:00.000Z (8 months ago)
- Last Synced: 2025-03-13T23:25:09.292Z (8 months ago)
- Topics: maze, maze-algorithms, maze-generation, maze-solving, simulation, visualization
- Language: TypeScript
- Homepage:
- Size: 369 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
## Abstract
Visualization of the generation and solution of mazes with various algorithms.
## NaPAC - Not another Pathfinding Algorithm Comparison
### Different types of mazes
* [ ] from long corridores (few forks) to small passages and many forks
* [ ] multiple solutions vs. unique solution (different maze generators)
* [ ] sparse (many clean areas like connected caves) vs. dense maze (only passages)
* [ ] circles vs circle-free
### Create your own maze
* [ ] set dimensions (width, height)
* [ ] set different grids by selecting rectangle, triangle or hexagonal cells
* [ ] set type of mazes
* perfect, with circles
* only with sparse/moderate/dense obstacles
* [ ] set the start and goal position yourself
* [ ] force the random path (solution) to be short, medium or long
* [ ] set your own seed
* to analyze the same maze with different algorithms, start and goal positions, etc.
* [ ] select own maze generator
* [ ] dig your maze by yourself (in one/some/every iteration)
* [ ] choose path finding algorithms
* [ ] tests different heuristics (taxicab, euclidean distance) for A* or other algorithms
* [ ] set flood option to flood the maze/playground after generation to visualize certain qualities
### Automation-galore
* [ ] provide ready to go setup
* [ ] select different start and goal positions in every iteration to not favour a specific algorithm
### Better control over the simulation
* [ ] play and pause the simulation any time
* [ ] change the simulation speed
* [ ] skip generation or solving to get faster to the results
* [ ] set auto pause after generation and/or solution to view the result
### Add more algorithms
* [ ] right-hand side algorithm
* [ ] left-hand side algorithm
## Inspirations
* [A Comparison of Pathfinding Algorithms](https://www.youtube.com/watch?v=GC-nBgi9r0U)
* [Path-finding Visualization Comparison](https://www.youtube.com/watch?v=aW9kZcJx64o)
* [Path finding algorithms comparison](https://www.youtube.com/watch?v=-bdFEaNeZMM)
* [Green Code - I Solved The World's Hardest Maze (with Code)](https://www.youtube.com/watch?v=4L7BDRmH4cM)
## Research Algorithms
* [Path Finding comparison](https://www.youtube.com/watch?v=tW1V2Xhabe8)
* [Variants of A*](https://en.wikipedia.org/wiki/A*_search_algorithm)
* [Jump Point Search - Wikipedia](https://en.wikipedia.org/wiki/Jump_point_search)
* [Jump Point Search - GameDev.net](https://www.gamedev.net/tutorials/programming/artificial-intelligence/jump-point-search-fast-a-pathfinding-for-uniform-cost-grids-r4220/)