This Python project showcases the A* search algorithm's application to finding the shortest routes between cities in France, considering road distances.
The script loads road data from a file, incorporates various heuristic functions for path cost estimation, and conducts A* searches to identify optimal routes. The flexibility of this project allows for both specific city-to-city searches and a comparative mode, enabling the evaluation of different heuristic strategies. During execution, the script provides comprehensive information about the search process, including node expansion and path length. Notably, the project was concluded with insights favoring the utilization of the straight-line distance heuristic for its accuracy and efficiency. This project offers a tangible demonstration of A* search and heuristic analysis, with a strong interest in algorithms and problem-solving.
Note: I have run this program in putty so its a zip file containing all files