Download "Coding Challenge 51.3: A* Pathfinding Algorithm - Part 3" legally, for free!
Wednesday 18th January 2017 Artist Coding Challenge 51.3: A* Pathfinding Algorithm 43,498 views 868 votes For 5 vote Against
In Part 3 of this Coding Challenge, I look at ways to improve the visual design of the A* algorithm and invite you to put your own spin on it. Part 1:...
In this Coding Challenge, I attempt an implementation of the A* pathfinding algorithm to find the optimal path between two points in a 2D grid. I begin by explaining the mechanics of how the algorithm works, look at pseudo-code, and then write the
In Part 2 of this A* Algorithm Coding Challenge, I focus on adding obstacles (walls) to the grid as well as functionality for moving diagonally. Part 1: https://youtu.be/aKYlikFAV4k Part 3: https://youtu.be/jwRT4PCT6RU Online demo:
Comments (0)