DragonAlpha

This guy is totally right. It is detectable playing on a jar file. A java applet can see it's running environment. This is why Mirror Mode is so essential. "That cant be the case otherwise we'd all be banned instantly!!!!!111!!1!!" - no. Just no. If they did that, it would INSTANTLY let the bot users and more importantly, the bot developers, know one of Jagex's bot detection methods, so the bot developers would just quickly write a work-around. That would be fucking dumb stupid and retarded to say that they can't see if you're running a jar file otherwise you'd all be banned. They would do it by stealth, in drips and drabs.

Are you using heuristics? I can't see how a heuristic can have any value when a node's neighbor is somewhere else on the map (instead of all the adjcacent tiles). Since the goal of the heuristic is to favor a tile that is closest to the destination. But what if in the exact opposite direction, just 5 tiles away there is a charter-ship which takes you much closer to the goal tile. If you are using a standard a* heuristic such as manhattan, then that won't take teleports/shortcuts into account. I see each tile as having 8 neighbors. (each tile around it). However, for tiles that contain a "Boat Charter Ship Npc", I class that as having 9 neighbors (all the tiles around it, and also a tile far away on the map where the boat takes you). I can only see Dijkstra being useful for this, unless there is some heuristic method that can take these wormholes/shortcuts/jumps into account?

Doing A* pathfinding with a web is pretty good. A* heuristic ensures that the most likely path is taken being more efficient. Let's take the Manhattan heuristic. Where the node closest to the goal node is considered the most likely/valuable one. What about when you are trying to write a web-walker-and-traveller. When you walk to say Port Sarim docks, and travel on the boat, you are instantly teleported from a node and put somewhere totally different. This renders any a* heuristic worthless, right? What alternative heuristic can we use, or should a* be scrapped altogether and just use DJkstra which does not rely on heuristics? Any advice appreciated. Teleports/shortcut examples: port sarim docks charter ships fairy ring teleports pull lever -> deep wilderness Why do this? You start in Draynor Village. Your code does: WebWalk.walkTo(ardougneMarketPos); A webwalker will WALK all the way there. A really long way, all over white wolf mountain. Well there is a much faster and efficient way to do it: starting in draynor village, walk to port sarim, get the boat to karamja, walk to brimhaven, get the boat to ardougne, then walk to market. This is why I am asking about web walker with shortcuts/teleports.

fire.getX() is getting the X coordinate for the fire. You need to get the x and y coordinates then add 1 to this but then you are doing the click wrong. mouse.click cannot be fed coordinates. It clicks the position on the screen mouseX, mouseY. You need to calculate what the screen mouse coordinates are for tht tile. You are confusing the 2. Tile coordinates (position in runescape world) and mouse sxreen coordinates, where 0, 0 means the top left of the screen.

Very good explanation. Had no idea on where to even start with a web walker. Was even considering doing GLOBAL a* (i know, inefficient). Thanks for the pointers.