#💬 masterflopsʹs Feedback
1 messages · Page 1 of 1 (latest)
algorithm sorts out the nearest one by one path in a pre-built nodes folder, it can navigate in all ways possible but it requires to change the threshold and the node distances, It works for every size no matter what. it can be a truck driver Algorithm, car driver algorithm, even boats or planes. But it requires it to Steer or move to it. Can be used on police cars, or cars that just race thru in a part. Big problem is, Performance intake, will take 10% or 20% sometimes on a 400 parts folder. Depending about how big the folder is, best way to optimize is to use less nodes and ranged nodes.
k
method and tactic based on:
Looks like djikstras algorithm
siimilar
I like the example