https://github.com/thatdns/running-mazey
Intelligent Mazey finds path through a maze!
https://github.com/thatdns/running-mazey
ai algorithms-implemented graph-algorithms heuristic-search-algorithms maze-game maze-generator maze-solver
Last synced: 8 months ago
JSON representation
Intelligent Mazey finds path through a maze!
- Host: GitHub
- URL: https://github.com/thatdns/running-mazey
- Owner: ThatDNS
- Created: 2019-07-12T19:34:56.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2024-07-05T16:52:07.000Z (over 1 year ago)
- Last Synced: 2025-03-21T06:41:31.594Z (8 months ago)
- Topics: ai, algorithms-implemented, graph-algorithms, heuristic-search-algorithms, maze-game, maze-generator, maze-solver
- Language: JavaScript
- Homepage:
- Size: 2.24 MB
- Stars: 7
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Running Mazey
This program generates a random maze from an initial grid and then Mazey (an A.I. :P) finds the approximate shortest path from top left corner to the bottom right corner of the grid.
## Algorithm Used: A* Search Algorithm
A* is a computer algorithm that is widely used in pathfinding and graph traversal, which is the process of finding a path between multiple points, called "nodes".
Peter Hart, Nils Nilsson and Bertram Raphael of Stanford Research Institute (now SRI International) first published the algorithm in 1968. It can be seen as an extension of Edsger Dijkstra's 1959 algorithm.
A* achieves better performance by using heuristics to guide its search.
## Step 1: Maze Generation
###### source: [Maze generation algorithms](https://en.wikipedia.org/wiki/Maze_generation_algorithm)
## Step 2: Finding the shortest path from top left corner to bottom right corner
###### source: [A* Search Alogrithm](https://en.wikipedia.org/wiki/A*_search_algorithm)
## Final path
## Author
Divyanshu N Singh
