Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/codernayeem/2d-maze-solver
Solve and view the solution path of a 2D Maze
https://github.com/codernayeem/2d-maze-solver
backtracking-algorithm cpp maze maze-solver
Last synced: 5 days ago
JSON representation
Solve and view the solution path of a 2D Maze
- Host: GitHub
- URL: https://github.com/codernayeem/2d-maze-solver
- Owner: codernayeem
- Created: 2022-09-15T15:08:58.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2022-09-17T13:25:55.000Z (over 2 years ago)
- Last Synced: 2023-08-07T17:35:47.676Z (over 1 year ago)
- Topics: backtracking-algorithm, cpp, maze, maze-solver
- Language: C++
- Homepage:
- Size: 13.7 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 2D-maze-solver
Solve and view the solution path of a 2D Maze
## Input & Output
* __Maze Input Example__:
1 1 1 1
1 0 1 1
1 1 1 0
0 1 1 1
* `0` => indicates __Obstacle__
* `1` => indicates __Free Space__
* **Output**:
* There can be one / multiple output maze solutions.
* Output can be two types.
* Normal Output will print with numbers where '2' represent solution path.
* Fancy Output will print with some character specified in styles array.
* **Normal Output Example**:
2 1 1 1
2 0 1 1
2 2 1 0
0 2 2 2
* **Fancy Output Example**:
. o o o
. # o o
. . o #
# . . .
* **No Solution Output**:
* `0` => If no Solution found
* `-1` => Start or End point is an obstacle/not in maze.
## **1. `mazeSolverOneWay.cpp`**
* Fastest. It will give a solve of the maze as soon as possible. That solve might not be the best solution.
* Can be used to check if a maze has at least one solution.
* **Input**:
*
*
*
* **Input Example**:
4 4
1 1 4 4
1 1 1 1
1 0 1 1
1 1 1 0
0 1 1 1
* **Normal Output Example**:
2 1 1 1
2 0 1 1
2 2 1 0
0 2 2 2
* **Fancy Output Example**:
. o o o
. # o o
. . o #
# . . .
## **2. `mazeSolverOneBestWay.cpp`**
* It will give just one best [__minimum steps__] solution. There can be multiple best solutions. But it will just give one.
* Can be used to check one of the best [__minimum steps__] solutions of the maze.
* **Input**:
*
*
*
* **Input Example**:
4 4
1 1 4 4
1 1 1 0
1 0 1 1
0 1 1 1
0 1 0 1
* **Output**:
* **Normal Output Example**:
7
2 2 2 0
1 0 2 1
0 1 2 2
0 1 0 2
* **Fancy Output Example**:
7
. . . #
o # . o
# o . .
# o # .
## **3. `mazeSolverMultiWay.cpp`**
* It will give every possible way to solve the maze.
* Can be used to see every possible solutions of the maze.
* **Input**:
*
*
*
* `` can be set to -1 to print all solution. Or, It can be a limiting value of solutions print count.
* **Input Example**:
3 3 -1
1 1 3 3
1 1 1
1 1 1
0 0 1
* **Output**:
* **Normal Output Example**:
4
2 1 1
2 2 2
0 0 2
2 2 2
2 2 2
0 0 2
2 2 1
1 2 2
0 0 2
2 2 2
1 1 2
0 0 2
* **Fancy Output Example**:
4
. o o
. . .
# # .
. . .
. . .
# # .
. . o
o . .
# # .
. . .
o o .
# # .
## **4. `mazeSolverMultiBestWay.cpp`**
* It will give every possible way [__minimum steps taken__] to solve the maze.
* Can be used to see every __best__ possible solutions of the maze.
* **Input**:
*
*
*
* `` can be set to -1 to print all solution. Or, It can be a limiting value of solutions print count.
* **Input Example**:
4 4 -1
1 1 4 3
1 1 1 1
1 1 1 1
1 1 0 1
0 1 1 1
* **Output**:
* **Normal Output Example**:
3 6
2 1 1 1
2 1 1 1
2 2 0 1
0 2 2 1
2 1 1 1
2 2 1 1
1 2 0 1
0 2 2 1
2 2 1 1
1 2 1 1
1 2 0 1
0 2 2 1
* **Fancy Output Example**:
3 6
. o o o
. o o o
. . # o
# . . o
. o o o
. . o o
o . # o
# . . o
. . o o
o . o o
o . # o
# . . o
## **5. `mazeSolverMultiBestBestWay.cpp`**
* It will give every possible way [__minimum steps taken__ & __minimum direction change__] to solve the maze.
* Can be used to see every __best of the best__ possible solutions of the maze.
* **Input**:
*
*
*
* `` can be set to -1 to print all solution. Or, It can be a limiting value of solutions print count.
* **Input Example**:
4 4 -1
1 1 4 3
1 1 1 1
1 1 1 1
1 1 0 1
0 1 1 1
* **Output**:
* **Normal Output Example**:
1 6 2
2 2 1 1
1 2 1 1
1 2 0 1
0 2 2 1
* **Fancy Output Example**:
1 6 2
. . o o
o . o o
o . # o
# . . o
## **6. `mazeSolverAllInOne.cpp`**
* It will give every possible way to solve the maze according given __mode__.
* Can be used to see __all__ / __best__ / __best of the best__ possible solutions of the maze.
* **Input**:
*
*
*
* `` can be set to -1 to print all solution. Or, It can be a limiting value of solutions print count.
* `` can be `0` / `1` / `2` to get __all__ / __best__ / __best of the best__ solutions.
* `mode == 0` => get all possible solve
* `mode == 1` => get all solve with __min steps__
* `mode == 2` => get all solve with __min steps__ & __min direction change__
* **Input Example**:
4 5 -1 2
1 1 4 5
1 1 1 1 1
1 1 0 0 1
0 1 1 0 1
0 0 1 1 1
* **Output**:
* **Normal Output Example**:
1 8 1
2 2 2 2 2
1 1 0 0 2
0 1 1 0 2
0 0 1 1 2
* **Fancy Output Example**:
1 8 1
. . . . .
o o # # .
# o o # .
# # o o .