Pathfinding

Balances cost-so-far (g) against an estimate to the goal (h). Optimal with an admissible heuristic, and far more focused than Dijkstra.