In games we often want to find paths from one location to another. We’re not only trying to find the shortest distance; we also want to take into account travel time. To find this path we can use a graph search algorithm, which works when the map is represented as a graph. A* is a popular choice for graph search. Breadth First Search is the simplest of the graph search algorithms, so let’s start there, and we’ll work our way up to A*.