Hey guys, 

 

For a project I'm making I need to travel trough whole Runescape. Now as you could guess, I'm not going to predefine every path. But the problem is I don't know how to make a webwalker. 

 

Could someone give me a push into the right direction? Don't need to be spoonfeeded.

A* is the most common

A* is the most common

 

This is the most commonly used and i would recommend getting a good understanding of it! ^_^

I'll get into it :3

Know what an edge weighted graph is and know how A* works. This is the basis of web walking, and in my opinion the minimum that you should understand before trying to make one. I created one about a year ago, it will take time, so don't think you will do this in a few days. If you have no pre-existing knowledge, this will likely take weeks.

Edited May 2, 201510 yr by Mysteryy

Or if performance is not really an issue, you don't want to spend too much time on it and 1-2s of computation is perfectly fine: BFS

Or if performance is not really an issue, you don't want to spend too much time on it and 1-2s of computation is perfectly fine: BFS

 

The problem is; if I don't create a webwalker I've to create over 80 paths and then I'm not even started with teleporting.

The problem is; if I don't create a webwalker I've to create over 80 paths and then I'm not even started with teleporting.

Yes I do understand the problem. But if you don't want to implement the A* algorithm and you create your vertices/edges in such a way that with teleports you only have to traverse like 6 edges to get pretty much anywhere (a lot of walking can be done locally), you can get away with a much simpler, but less efficient algorithm (breadth-first search for example).

Yes I do understand the problem. But if you don't want to implement the A* algorithm and you create your vertices/edges in such a way that with teleports you only have to traverse like 6 edges to get pretty much anywhere (a lot of walking can be done locally), you can get away with a much simpler, but less efficient algorithm (breadth-first search for example).

 

How am I supposed to get the mapData? 

play with this, have fun.

getMap().getRegion(); //return regionn instance

http://osbot.org/api/org/osbot/rs07/api/map/Region.html

Edited May 3, 201510 yr by josedpay

play with this, have fun.

getMap().getRegion(); //return regionn instance

http://osbot.org/api/org/osbot/rs07/api/map/Region.html

 

what about getting the mapdata.idx?

Learn A* first. It was one of the first algorithms I learned and it's really simple, trust me.

 

Practice A* with a tile-based 2D game first then build up from there to gain a better understanding.

Just incase you want a fast way to make yourself the paths ; http://osbot.org/forum/topic/61609-path-generator-zwalker-portre-release/
Look at the mediafire link in the replies from elliot ;)

Just incase you want a fast way to make yourself the paths ; http://osbot.org/forum/topic/61609-path-generator-zwalker-portre-release/

Look at the mediafire link in the replies from elliot

 

Already got basic working of webwalking working. Few small problems but nothing that breaks the whole script.

 

Have to add teleport and shit now. Thinking of a logical way of handling that without using tons of codes.

 

Thanks anyway

Edited May 4, 201510 yr by Psvxe