In this course, we'll combine everything we've learned to solve pathfinding problems in gaming.
Implemented Breadth-First-Search in an application using a Grid representation of the world.
Implemented A*
Go back to the previous Bonus Exercise for 206 Graphs and use Dijkstra to find the shortest path between two stations.