Here is a demonstration of A*(A-Star) pathfinding algorithm. If you want to use it dont forget to credit ;) ▬▬▬▬▬▬▬▬▬Instructions▬▬▬▬▬▬▬▬▬▬ ►Press green flag again to generate new start and end tiles or restart. ►Press a tile to change its solid value. ►Press space to find the path. ▬▬▬▬▬▬▬▬▬▬Info▬▬▬▬▬▬▬▬▬▬▬▬ Allowed moves are: ►Up ►Down ►Left ►Right It will calculate the shortest path with these rules. Heap is not improved so... um yeah not too good :/
All code by me @scripter24 If you find any bugs please report under this project. ▬▬▬▬▬▬▬▬▬▬Credits▬▬▬▬▬▬▬▬▬▬▬ Thanks for Sebastian Lague for his explanation video about A* pathfinding. Go and check it out: https://www.youtube.com/watch?v=-L-WgKMFuhE&t=461s :]
