Pathfinding Algorithm Visualizer

Overview

The Pathfinding Algorithm Visualizer is a tool designed to help users understand and visualize different pathfinding algorithms. It allows users to create a grid-based environment, set start and end points, generate obstacles, and see how various pathfinding algorithms find the shortest path between two points.

Download

To download this project ⬇ Download PythonPathVisualizer.exe

Screenshots

Features

• Three Pathfinding Algorithms:
  • A* Algorithm
    • 
  • Breadth-First Search (BFS)
    • 
  • Dijkstra's Algorithm
    • 
• Map Layout Options:
  • Empty Grid
    • 
  • Random Noise
    • 
  • Recursive Division Maze
    • 
• Interactive Grid:
  • Click to set the start and end points.
    • 
  • Click to add or remove barriers.
• Seed-based Map Generation:
  • Enter a seed value for consistent map generation.
  • Randomize the seed to generate a new maze.
• User Controls:
  • Select an algorithm.
  • Generate a maze.
  • Start the search.
  • Reset the grid.
  • View runtime of the algorithm.

How to Use

1. Launch the Application: Open the executable file.
2. Select an Algorithm: Choose between A*, BFS, or Dijkstra's Algorithm.
3. Choose a Map Layout: Select an empty grid, random noise, or a recursive division maze.
4. Set Start and End Points: Click on the grid to place the start (green) and end (red) points.
5. Add Barriers: Click on cells to turn them into obstacles.
6. Generate a Map: Use a specific seed for consistent maps or randomize for a unique layout.
7. Run the Algorithm: Click "Start Search" to visualize the algorithm in action.
8. Reset the Grid: Clear the grid to start over.

System Requirements

• Windows OS
• No additional dependencies required (Standalone Executable)

Installation

Simply download and run the executable file. No installation or dependencies are needed.

Controls

• Left Click: Place start, end, or barrier tiles.
• Buttons:
  • "Generate Map" – Creates a grid based on the selected layout.
  • "Start Search" – Begins the pathfinding visualization.
  • "Reset Grid" – Clears the grid.
  • "Instructions" – Provides guidance on how to use the tool.

Notes

• The application runs as an executable file, so users do not need to install Python or any libraries.
• Seed-based map generation ensures that the same seed will always generate the same layout.
• Some algorithms may take longer to compute depending on the complexity of the map.

License

This project is licensed under the MIT License LICENSE.

Author

Developed by Shubhayu Kundu.