## A* Pathfinding Algorithm - Part 1

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.

### Community Contributions

- Pathfinding Visualizer (A*, BFS, DFS, Greedy...)
*by Khalid Saifullah*(Source Code) - 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) - Pathfinding A* in Windows Form using C#
*by Trong Hieu Nguyen*(Source Code) - Astar Maze solver
*by David Snyder*(Source Code) - A* and other algorithms implementation in Flutter using dart
*by Ege Gungordu*(Source Code) - A* pathfinding to solve a maze
*by Mike Kotte* - A* path finding visualization in React
*by Subesh Bhandari* - A* Pathfinding Visualisation in JavaScript!
*by Joe Wadsworth*(Source Code) - BFS Visualizer in JS
*by Som Shekhar Mukherjee*(Source Code) - Motion Planning Algorithm Visualizer
*by Kaapeine* - 3D PathFinder
*by Yogesh Kumar*(Source Code) - A* Pathfinding Visualisation in vanilla JS
*by Shekhar Tyagi*(Source Code) - Eight puzzle solver hosted on github pages
*by Tahsin Tariq* - A* pathfinding algorithm made to look like lightning
*by Daniel Sarno*(Source Code) - Maze creator and pathfinding
*by Nguyen Tran*(Source Code) - A* pathfinding with grid drawing !
*by Sulaymane Dagnet*(Source Code)

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