SRL Archive - General

I wasn't really sure what programming section to post this in, so I will just post it here. This is a question for some of you guys who have worked with sps and walking methods or anyone familiar with this algorithm. I am trying to implement Dijkstra's algorithm - no matter how many times I say it, I still gotta look it up to spell it. So I was wondering, have you implemented any walking/navigating for shortest route programs? If so, how? I am especially interested in how walking is implemented in runescape. Runescape is especially good for this because all you do in runescape is click and it walks to the desired spot while choosing the shortest route possible. If someone can explain in words please

Though i do not have extended experience with these types of algorithms, i have always preferred to implement A* algorithm into my walking on my mini games that i create. i would recommend u look at the pseudocode on wikipedia, because that is rather easy to understand. I haven't attempted to adopt those algorithms into a script though.

I have looked at a lot of the pseudocode on wikipedia, but I need someone who has done it and is able to explain it in words…sentences

From: [Re]cUrSivE
I have looked at a lot of the pseudocode on wikipedia, but I need someone who has done it and is able to explain it in words…sentences

sounds like the definition of a tut XD try this out maybe: http://www.youtube.com/watch?v=NJOf_MYGrYs