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.

- Implementation in R
*by Kristian Wichmann*(Source Code) - A* Pathfinding with random map regeneration on algorithm completion
*by Don Wilson*(Source Code) - Astar algorithm used to solve the maze
*by Makarand Lahane*(Source Code) - AStar path finder with drawable obstacles
*by Shramee Srivastav*(Source Code)

You can also add your own version! (See how)