Download "Coding Challenge 51.2: A* Pathfinding Algorithm - Part 2" legally, for free!
Tuesday 17th January 2017 Artist Coding Challenge 51.2: A* Pathfinding Algorithm 53,993 views 928 votes For 11 vote Against
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 ...
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 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: https://youtu.be/aKYlikFAV4k Part 2: https://youtu.be/EaZxUCWAjb0 Online demo:
Comments (0)