Skip to content

Repository files navigation

Pathfinding algorithm using A*

Due do struggles with git I decided to upload only my own files in this repo for now. Other files used are the same as in the previous projects, specifically:

  • Engine project

Comparision of the first version of the algorithm:
Screenshot_2
https://www.youtube.com/watch?v=ChtlBH_61W8
And the improved one:
Screenshot_1
https://www.youtube.com/watch?v=1MXiVquZZWY

The way it works now is that instead of going through all the optimal paths
"one step at a time" it goes through the first one found until it's not optimal
then it switches to the second one and so on. So worst case it's similar to the first one.
Best case, it's much better

About

Pathfinding using A* algorithm

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages