SRL Archive - Help and Support

I need an algorithm for Simba that finds a path from A to B with given facts
- all A's neighbors (C, D)
– all A's neighbors' neighbors
–> C's neighbors (A, D, F)

- all B's neighbors (F)
– all B's neighbors' neighbors
–>F's neighbors (B, D, C)

So in this case the path from A to B would be
1) A -> C -> F -> B
2) A -> D -> F -> B

It'd be cool to find all the possibilities.
And yes, I'm working on a webwalker as well, but with a very different approach to RM :rolleyes:

I might be wrong but couldnt you just use the distance formula thats what im doing in my web walker

From: J_Pizzle
I might be wrong but couldnt you just use the distance formula thats what im doing in my web walker

How do you mean?
Attached the idea I'm after. Find neighbors and the shortest way from area to another. I already got it basically working inside 1 area.

There are a variety of algorithms available, so it's up to you to choose one you want. Here are a few of them.

Maybe you can use Dijkstra's algorithm which is already ported to SCAR?
http://villavu.com/forum/showthread.php?t=51556
http://villavu.com/forum/showthread.php?t=36548

the post u want is http://villavu.com/forum/showpost.php?p=468338&postcount=6

From: n3ss3s
the post u want is http://villavu.com/forum/showpost.php?p=468338&postcount=6

Wow, if that really works we already have a webwalker? Just run around and record tiles to a file. Sweet :)

From: Method
There are a variety of algorithms available, so it's up to you to choose one you want. Here are a few of them.

Thanks for this. It suits one of my projects although I had my own algorithm in my mind :P