By default, the engine only has one path-finding algorithm, its called A* (A star), which is efficient, but occasionally doesn't actually find the best route, but just a good enough route. It would be better if we could have multiple path finding algorithm so we can use the most efficient one on the right place, some path finding algorithms are optimized for certain situations while other are better for other type of situations.
Here is a library that probably has what we need and would save us a lot of time if we could implement it into the engine, also I'll attack a document where Pathfinding is explained better and in a more visual way.
By default, the engine only has one path-finding algorithm, its called A* (A star), which is efficient, but occasionally doesn't actually find the best route, but just a good enough route. It would be better if we could have multiple path finding algorithm so we can use the most efficient one on the right place, some path finding algorithms are optimized for certain situations while other are better for other type of situations.
Here is a library that probably has what we need and would save us a lot of time if we could implement it into the engine, also I'll attack a document where Pathfinding is explained better and in a more visual way.
AnyAnglePathfindingPresentation.pdf