HeuristicSearch | Artifical Intelligence project : AStar family

HeuristicSearch is a Python library. HeuristicSearch has no bugs, it has no vulnerabilities, it has build file available and it has low support. You can download it from GitHub.

in this project, the astar family of algorithms were implemented to show how a computer can find its own optimal path. to better understand the performance and how a heuristic guides the algorithm, there are five different heuristic implementations (all the heuristic formulas can be found under algorithms/formulas.py):. in addition, there is also the uniform cost search algorithm which does not use any heuristic; resulting in the shortest path cost to the goal (manhattan and euclidean give the same path length cost if their weight is set to one). you must have python 3+ installed with pygame and numpy. if you want to run maptest.py, you will need xlwt and pympler as well. if you have python2 installed alongside python3, then run the following commands using pip3. install pygame and numpy for the main program. install xlwt and pympler for the maptest.pyprogram. if you have cython