Welcome to the first part in a series teaching pathfinding for video games. In this episode we take a look at the A* algorithm and how it works. Some great A* learning resources: http://theory.stanford.edu/~amitp/GameProgramming/
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
Welcome to the third part in a series on pathfinding in Unity. In this episode we implement the A* search algorithm (explained in detail in part one: https://youtu.be/-L-WgKMFuhE?list=PLFt_AvWsXl0cq5Umv3pMC9SPnKjfp9eGW) Source code:
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:
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:
Welcome to the first live episode of The Coding Train! In today's session, I attempt to implement the A* Pathfinding Algorithm. I start by explaining the mechanics of how the algorithm work and discuss various applications focusing on 2D pathfinding.
