coding challenge #51.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 algorithm in JavaScript using the p5.js library for rendering.

It seems like there haven't been made any variations based on this coding challenge by the community yet. Be the first and add your own! If you don't know how, take a look at this guide.