Coding Challenge 51.1: A* Pathfinding Algorithm - Part 1

Coding Challenge 51.1: A* Pathfinding Algorithm - Part 1
The Coding Train

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 algorithm in JavaScript using the p5.js library for rendering. Part 2 focuses on adding obstacles (walls) to the grid as well as functionality for moving diagonally. In Part 3, I look at ways to improve the visual design and invite you to put your own spin on it.

-Challenge Webpage: https://thecodingtrain.com/CodingChal...
-Online demo: https://codingtrain.github.io/AStar/
-Part 2: https://youtu.be/EaZxUCWAjb0
-Part 3: https://youtu.be/jwRT4PCT6RU
-Unedited Challenge: https://www.youtube.com/watch?v=S4yQY...

0:00 Introduction
1:26 A* Pathfinder
9:39 Coding a Grid
13:09 A* Pathfinder Algorithm
22:07 Choosing Best Available Path
27:05 Finding New Nodes
38:30 Adding Heuristic
41:50 Tracing Back
46:49 Using Better Heuristics

https://youtu.be/aKYlikFAV4k