Atur
02-21-2009, 10:41 PM
Lets say I a number of n' points in 3d space with XYZ values.
All points are linked somehow,
Some directly, some through other points.
For instance:
A---B
|
E---------F
|
C---D
I can go from A to B directly, I can only go from D to A through C and E.
My question, lets say I have hundreds of points, and I know to what points each point is linked directly, how do I find the shortest route(shortest in distance / or the amount of points you to go through).
How do I teach the computer AI code to find a route quickly from point X to point Y?
I require this for mob AI.:o
Thank you in advance for any help with this routing issue.
All points are linked somehow,
Some directly, some through other points.
For instance:
A---B
|
E---------F
|
C---D
I can go from A to B directly, I can only go from D to A through C and E.
My question, lets say I have hundreds of points, and I know to what points each point is linked directly, how do I find the shortest route(shortest in distance / or the amount of points you to go through).
How do I teach the computer AI code to find a route quickly from point X to point Y?
I require this for mob AI.:o
Thank you in advance for any help with this routing issue.