Why and How?
"Artificial Intelligence is the new Electricity." -Dr. Andrew NG
This is an era where automation is the currency. Gone are those days of manual works and repetitive tasks. Being it the hardest chess move or the solution of a rubic cube, leave it on AI. Finding the shortest path is also one of the prominent examples of this domain, and we are here to bring forth one such approach.
Find the Best Path
The main motivation behind the A* path finder algorithm is to optimize the moves and find the shortest path between two given points.
Get it optimized
Time complexity also matters when we are designing any algorithm. Hence in this project, we have tried to obtain the least time complexity in the algorithm and the fastest response time.
Robust like Rock
Special care has been taken while working on the robustness of the application. This application is platform independent. Just download and run it, that's all you need.
DOWNLOADS
Download the project and use it.
Team
Mainak Chaudhuri
Team Lead and Integrator
Sadhavi Thapa
Web Designer
Kanishka Gaur
BFS and Backtracking Coder
Harishankar PV
GUI MapperContact
Feel free to reach out to us for any updates.
Location:
SRMIST Chennai
Email:
astarpf@gmail.com
Call:
+91 89817 97415