https://github.com/enesser/maze-solver
Maze puzzle solver, written in Node.
https://github.com/enesser/maze-solver
Last synced: 3 months ago
JSON representation
Maze puzzle solver, written in Node.
- Host: GitHub
- URL: https://github.com/enesser/maze-solver
- Owner: enesser
- License: mit
- Created: 2014-10-08T13:53:44.000Z (over 10 years ago)
- Default Branch: master
- Last Pushed: 2016-02-18T06:57:36.000Z (about 9 years ago)
- Last Synced: 2024-04-24T11:22:12.898Z (about 1 year ago)
- Language: JavaScript
- Homepage:
- Size: 91.8 KB
- Stars: 8
- Watchers: 1
- Forks: 3
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
Maze Solver
==========
[](https://travis-ci.org/enesser/maze-solver.svg?branch=master)
[](https://david-dm.org/enesser/maze-solver.svg?style=flat)
[](https://david-dm.org/enesser/maze-solver/dev-status.svg?style=flat)
Maze puzzle solver, implemented in Node.
## Overview
I heard about a cool interview challenge where a company would ask you to
implement a maze solver in C# and .NET. I thought I'd try it just for fun.
I did the initial version in C#, and decided to make a Node version. The Node version is much faster. It can solve the sample mazes in two milliseconds or less.
This maze solver loads custom mazes stored in text files and solves them. Although this ships with a console demo, the maze solver module can be used on the web or in a GUI application. Have fun!
## Instructions
The demo app can be executed from a Bash or DOS prompt:
`usage: node app (filename)`
Example:
`$ node app maze-sample-1 maze-sample-2`
You can create custom text maps with whatever legend you prefer. The default legend is:
```
[#] Wall
[.] Path
[A] Start Point
[B] End Point
```
## How It Works
The maze solver keeps track of where it has been in the current iteration and all iterations of trying to solve the maze. It won't double-back on any space it's been in the current iteration, and it priortizes the next step forward by the path least traveled across all iterations.
When the maze solver ends up traveling a path so many times that it exceeds the number of spaces in the map, it gives up and decides there is no possible route to the end point.
If the solver finds an end point, it considers the path victorious and uses a formatter module to show the solution in color on the console. The formatter is optional and you can swap it for your own to make a GUI-based or web version.
## Contributions
Contributions in the form of code, issues, or custom maps are always welcome!
## License
Copyright (c) 2014 Eric J Nesser
MIT