GML implementation of the A* pathfinding algorithm. Supports diagonal movement, optional corner cutting, weighted node values, max search depths for paths, and multi-tile object pathfinding.
NOTE: This is not my code. It was made by Jake Armstrong and originally posted on the GM forums. However, I have ported the code to GMS:2