Post: #14

Quote:The A* also does not need waypoints, if you don't mind about the process usage, you can make the npc run from Britain to Minoc, however, the max distance of search is limited due high amount of processing required to find long paths
Waypoints were designed to be a simple predefined route.

See my idea is basically a parallel of Callandor2k's. Dijkstra's algorithm is just A* without heuristics, so it's literally the same thing.

The only question I see is...

Static: Make every waypoint have set paths with known distances.
Advantage: Speed
Disadvantage: Changes are a pain.

Dynamic: Periodically do a FORITEMS and measure distance to all current waypoints to get the list.
Advantage: Easy to change on the fly
Disadvantage: Periodic re-calculation required, including whether there actually IS a direct path between the waypoints or if that line would hit major obstacles.