Tag Archives: pathfinding

The Basics of A* Pathfinding – part 1

The A* algorithm allows you to find the shortest path between two points with (impassable) obstacles between them. The key word here is “shortest”. Let’s take a look at what that means: How A* “sees” it Imagine we have the … Continue reading

Posted in Examples, Game Dev | Tagged , , , , , , , , , , , | 12 Comments