Maze Solver Project by Manas Ranjan Sahoo

Maze Solver

The Maze Solver is a program that takes input as an NxN matrix and outputs the path of the maze denoting 1 as path and 0 as block/wall.

How to run MazeSolver exe file in windows operating system :

First of All Download the MazeBt.exe File and install it, . When you Install It the all file automatically extracted and Automatic generated a Folder Named as MazeBt. . next Open The MazeBt Folder ,The Folder consists of -:

• 1.input.txt (input example Matrix form)
• 2.MazeBt.exe
• 3.MaeBt.py
• 4.RUN.bat (for window user only)
• 5.RUNLINUX.sh (for linux user)

.Next Give the input maze in the n*n matrix form with binary digit input (1,0) and notice: gap between each cell will be compulsory a example matrix alredy given there as input.txt .next and final step double click the RUN.bat file it takes 2seconds to run and path.txt file generated automatically which consists of solved maze matrix with executed time and date and with movement direction from source to destination.

How to run MazeSolver exe file In Linux Operating System :

Open the MazeBt folder from GitHub Repo .Next Give the input maze in the n*n matrix form with binary digit input (1,0) and notice: gap between each cell will be compulsory like 0,1,0,0,1 a example matrix alredy given there as input.txt .next and final step double click the RUNLINUX.sh file it takes 2seconds to run and path.txt file generated automatically which consists of solved maze matrix with executed time and date and with movement direction from source to destination.

Technology used in this Project :

• argparse – This is the python module for taking input in command line interface
• filesystem(read,append,write)- with this function we read the input file, append and write the o/p string formate in the output path text File .
• pyinstaller used for converting the python file into exe file .
• nsis software for making user friendly exe file for easy installation for users.

My Approach to Solve the problem :

My first approach is always to do this project by BFS \n because breadth-first search always gives the shortest path as the nature of its algorithm, But i spend lot times in reading articles and youtube but finally understand that for solving maze problem backtracking with recursion is the best approach to solve this Maze solver.

Demo :