Hello.
The "standar" pathfindig algoritm A* es useful for you. One system for make your movement is increment the cost of nodes proportionally to the distance to grey player.
Low distance -> high cost
high distance -> low cost
The A* make your curve automatically
I write a pathfinding function really fast.
it take in my machine 4.5 seg in traverse a map of 100000 nodes and only 384 millisec for a map with 10000 nodes. All nodes are traversables in 8 directions with a random cost. If not all nodes are traversables the time is reduced.
The algoritm is useful with any number of directions.
If you need it talk with me. It is free :-)
Bye,
Paposo
The "standar" pathfindig algoritm A* es useful for you. One system for make your movement is increment the cost of nodes proportionally to the distance to grey player.
Low distance -> high cost
high distance -> low cost
The A* make your curve automatically
I write a pathfinding function really fast.
it take in my machine 4.5 seg in traverse a map of 100000 nodes and only 384 millisec for a map with 10000 nodes. All nodes are traversables in 8 directions with a random cost. If not all nodes are traversables the time is reduced.
The algoritm is useful with any number of directions.
If you need it talk with me. It is free :-)
Bye,
Paposo