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

From the creator

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: https://thecodingtrain.com/challenges/51-a-pathfinding-algorithm 💻 Github Repo: https://github.com/CodingTrain/AStar 🕹️ p5.js Web Editor Sketch: https://editor.p5js.org/codingtrain/sketches/ehLjdFpat Other Parts of this Challenge: 📺 A* Algorithm - Part 2: https://youtu.be/EaZxUCWAjb0 📺 A* Algorithm - Part 3: https://youtu.be/jwRT4PCT6RU 🎥 Previous video: https://youtu.be/QHEQuoIKgNE?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH 🎥 Next video: https://youtu.be/l__fEY1xanY?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH 🎥 All videos: https://www.youtube.com/playlist?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH References: 📘 Artificial Intelligence: A Modern Approach: http://aima.cs.berkeley.edu/ 🗄 A* Search Algorithm on Wikipedia: https://en.wikipedia.org/wiki/A*_search_algorithm 💻 Online demo: https://codingtrain.github.io/AStar/ Live Stream Archive: 🔴 Live Stream #72: https://www.youtube.com/watch?v=S4yQYiAECnM&t=34m50s Related Coding Challenges: 🚂 #10 Maze Generator: https://youtu.be/HyK_Q5rrcr4 🚂 #162 Self Avoiding Walk: https://youtu.be/m6-cm6GZ1iw 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 Ani

Published 2017-01-16 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.