https://github.com/eiz/maze-solver
Ridiculously simple A* based 2D path finder in Common Lisp
https://github.com/eiz/maze-solver
Last synced: 6 months ago
JSON representation
Ridiculously simple A* based 2D path finder in Common Lisp
- Host: GitHub
- URL: https://github.com/eiz/maze-solver
- Owner: eiz
- Created: 2015-12-01T03:19:52.000Z (over 10 years ago)
- Default Branch: master
- Last Pushed: 2015-12-12T03:51:18.000Z (over 10 years ago)
- Last Synced: 2025-04-08T23:23:47.921Z (over 1 year ago)
- Language: Common Lisp
- Homepage:
- Size: 11.7 KB
- Stars: 2
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# maze-solver
Takes a 2D map and finds the shortest path from the start to end.
Syntax:
- # for walls
- S/s for starting point
- E/e for end point
- Any other character is treated as empty space
**MAZE-SOLVER:SOLVE-MAZE-FROM-FILE** and **MAZE-SOLVER:SOLVE-MAZE-FROM-STRING** are the public API. They return either *NIL* if no solution is found, or a list of X/Y pairs for each step in the path, including the start and end points.