Thread: A* pathfinding

phuckrunescape is fairly correct here. Client-sided calculation for pathfinding is optimal, I doubt any of the significant portion of the code testing is done on the server. Everyone is on the same revision, everyone's maps look the same and I'd dare say everyone's map data is accessible by client, there is no maphacking to defend against, only no-clipping. I'd also agree that tile-checks through the server are probably a method but I would like to know the communication being done here when you do hit several tiles and have to recalculate, unless of course the tiles are being sent across before-calculation... in fact that is probably a good guess.

Again, we're on RuneServer, we could argue about this all day. phuckrunescape brings up valid points though.

idk who Killer99 is but good work.

Originally Posted by phuckrunescape

As you can see in my walking system, array access and bitshifts are nothing compared to the intensity of A*..

don't understand this comment, the two are completely independent things. my own implementation of A* uses both accessing of arrays and bitshifts...

edit: oh ur that idiot Colby bye.

Why is anyone using an array anyway. My C# A* implementation uses a combination of Linked Lists and Lists. There's no need to use an array as the data structure for path finding.

Originally Posted by Inside Sin

Why is anyone using an array anyway. My C# A* implementation uses a combination of Linked Lists and Lists. There's no need to use an array as the data structure for path finding.

two dimensional array of tile traversal flags. so you can get a coordinates traversal flag by just going tiles[x][y]. there's no "need" to use any specific data structure.


relevant:

Originally Posted by phuckrunescape

first one to have 500 data on 317

er no pali was the first with that

Originally Posted by Scu11

two dimensional array of tile traversal flags. so you can get a coordinates traversal flag by just going tiles[x][y]. there's no "need" to use any specific data structure.


relevant:



er no pali was the first with that

LinkedList isn't required. Use a list over array whenever possible.

there's no "need" to use any specific data structure.

Actually generally speaking there is a large need. Not here, no, but in order to better your understanding it's important to ask the question on how much faster I can do it. I haven't looked into the matter of what you or the other guy is using but I strongly agree with using Lists in this area of theory.

Originally Posted by Inside Sin

Use a list over array whenever possible

what, why...?

Originally Posted by Inside Sin

Actually generally speaking there is a large need. Not here, no, but in order to better your understanding it's important to ask the question on how much faster I can do it. I haven't looked into the matter of what you or the other guy is using but I strongly agree with using Lists in this area of theory.

you can't do it faster with a list than an array lol, array lookup is O(1), there's nothing faster than that. there's no searching or insertion involved (other than population which should be done at server startup).