Explore the A* (A-Star) path finding algorithm through a comprehensive C++ tutorial implementation running at the command prompt. Learn about checking neighbors, nodes, drawing and connecting nodes, starting and end nodes, sorting lists, and solving A* problems. Gain practical insights into this tricky but powerful algorithm, complete with a worked example and demonstration. Access the source code on GitHub and visit the blog for additional resources.
Path Planning - A* (A-Star) Algorithm Implementation in C++
Overview
Syllabus
Introduction
Worked Example
Checking Neighbors
Nodes
Demonstration
Drawing Nodes
Connecting Nodes
Starting End Nodes
Sorting the List
Solve a Star
Taught by
javidx9
