Akankshabairagi55 / terminal-based-maze-solver

Navigate through intricate mazes with Maze Solver! ๐Ÿงฉ๐Ÿ” This handy tool intelligently finds the shortest path from start to finish, sparing you the frustration. Simply input the maze, and voilร ! It efficiently charts the course, making maze-solving a breeze. Get ready to conquer those labyrinthine challenges! ๐Ÿšถโ€โ™‚๏ธ๐ŸŽ‰

Home Page:https://drive.google.com/file/d/1sqouQdwL91RpaqYFd2IZqGyfC4yWQWA1/view?usp=sharing

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Terminal-Based Maze Solver

This Terminal-Based Maze Solver is a command-line tool designed to find the solution to a maze inputted through text files. It offers a simple yet effective way to visualize and solve mazes without the need for a graphical interface.

Features

  • Command-Line Interface: Easy-to-use interface accessible from the terminal.
  • Support for Custom Mazes: Ability to load custom maze files in text format.
  • Multiple Algorithms: Supports various maze-solving algorithms for finding the solution.
  • Visual Representation: Renders the maze and solution path in the terminal for visualization.

Usage

To use the Terminal-Based Maze Solver, follow these steps:

  1. Clone the Repository: Clone this repository to your local machine.

        git clone https://github.com/Akankshabairagi55/terminal-based-maze-solver.git
    
  2. Navigate to the Directory: Move to the directory where the repository was cloned.

        cd terminal-based-maze-solver
    
  3. Install Dependencies (if any): If there are any dependencies required, make sure to install them. This might vary based on the specific implementation.

  4. Run the Solver: Execute the solver script and provide the maze file as input.

        python TerminalBasedMazeSolver.py
    
  5. Follow Instructions: Follow the instructions provided by the solver in the terminal to choose the algorithm and visualize the solution.

Supported Algorithms

The following algorithms are currently supported by the Maze Solver:

  • Backtracking
  • Breadth-First Search (BFS)

Input Maze Format

Mazes should be provided in text files with the following format:

  • 'โ–“': Denotes walls or barriers.
  • 'S': Denotes the start point.
  • 'E': Denotes the end point.
  • 'โ—Œ' (space): Denotes the traversable path.

Example:

output

Contributions

Contributions to this project are welcome! If you have any suggestions, bug reports, or feature requests, feel free to open an issue or create a pull request.


Enjoy solving mazes with the Terminal-Based Maze Solver! If you encounter any issues or have any questions, don't hesitate to reach out.

About

Navigate through intricate mazes with Maze Solver! ๐Ÿงฉ๐Ÿ” This handy tool intelligently finds the shortest path from start to finish, sparing you the frustration. Simply input the maze, and voilร ! It efficiently charts the course, making maze-solving a breeze. Get ready to conquer those labyrinthine challenges! ๐Ÿšถโ€โ™‚๏ธ๐ŸŽ‰

https://drive.google.com/file/d/1sqouQdwL91RpaqYFd2IZqGyfC4yWQWA1/view?usp=sharing


Languages

Language:Python 100.0%