Getting from A to B: Understanding the Basics of Pathfinding
In this video, John Pressman walks us through the basics of path finding, from what it is to how it is used in the real world. We will be introduced to the concept of graphs and how they can be used to represent geographies and game maps. John will then walk through three different path finding algorithms: breadth-first search, Dijkstra's Algorithm, and A* detailing how each work and differ from & build upon each other. We will also learn how heuristics and weighted graphs can help find short/cost efficient roots in less time.
Project Members: John Pressman