This tutorial utilizes the great A* pathfinding code uploaded by Lerg which is found here: http://developer.anscamobile.com/code/pathfinding-module
A* allows you to find the shortest path from point A to point B while navigating around obstacles (which for this tutorial we will call walls). A* has many uses in game development. The best way to explain it is with a certain type of game, Tower Defense. In those games, a minion spawns at a certain location, point A. It has to get to the player's base to damage it, point B. However, the player has placed obstacles around the map to stop the minions so the minion has to find the best path around the obstacles to get to the base. This is where A* comes in. So enough of what it's supposed to do, let's see it in action using Lerg's A* pathfinding module.