A* Pathfinding Algorithm (Coding Challenge 51 - Part 1)

In this multi-part coding challenge, I attempt an implementation of the A* Pathfinding Algorithm to find the optimal path between two points in a 2D grid. Code: 💻 Github Repo: 🕹️ Web Editor Sketch: Other Parts of this Challenge: 📺 A* Algorithm - Part 2: 📺 A* Algorithm - Part 3: 🎥 Previous video: 🎥 Next video: 🎥 All videos: References: 📘 Artificial Intelligence: A Modern Approach: 🗄 A* Search Algorithm on Wikipedia: *_search_algorithm 💻 Online demo: Live Stream Archive: 🔴 Live Stream #72: Related Coding Challenges: 🚂 #10 Maze Generator: 🚂 #162 Self Avoiding Walk: Timestamps: 0:00:00 Introduction 0:01:26 A* Pathfinder 0:09:39 Coding a Grid 0:13:09 A* Pathfinder Algorithm 0:22:07 Choosing Best Available Path 0:27:05 Finding New Nodes 0:38:30 Adding Heuristic 0:41:50 Tracing Back 0:46:49 Using Better Heuristics Editing by Mathieu Blanchette Animations by Jason Heglund Music from Epidemic Sound 🚂 Website: 👾 Share Your Creation! 🚩 Suggest Topics: 💡 GitHub: 💬 Discord: 💖 Membership: 🛒 Store: 🖋️ Twitter: 📸 Instagram: 🎥 Coding Challenges: 🎥 Intro to Programming: 🔗 : 🔗 Web Editor: 🔗 Processing: 📄 Code of Conduct: This description was auto-generated. If you see a problem, please open an issue: #aalgorithm #pathfinding #heuristic #p5js #javascript