Skip to content

The project Path Finder is a demonstration of finding the shortest path while avoiding obstacles using AI (Artificial Intelligence). A* algorithm is used for finding the shortest path, Pygame, and Tkinter for visualization of the whole process.

Notifications You must be signed in to change notification settings

Hillol-Talukdar/Path-Finder

Repository files navigation

Path-Finder

The project Path Finder is a demonstration of finding the shortest path while avoiding the obstacles using AI (Artificial Intelligence). A* algorithm is used for finding the shortest path, Pygame and Tkinter for visualization the whole process.


Some pictures of the project are given below to understand the project. Please click on the picture for a better view.


Main Menu

save


Search Window

After clicking the start button this window will start.

search_grid


Select Source, Destination, Obstacles

First click on the grid will consider as a source(CYAN Colored), second one as a destination(MAGENTA Colored) and others are obstacles(RED colored).

obstacles_selected


After Shortest Path Found

LIME colored path is showing the shortest path avoiding the obstacles. White colored cells are visited cells during the search. Pop-up dialoges will show the path find status.

shortest_path_found

About

The project Path Finder is a demonstration of finding the shortest path while avoiding obstacles using AI (Artificial Intelligence). A* algorithm is used for finding the shortest path, Pygame, and Tkinter for visualization of the whole process.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages