Flamezzz

I think you get some issues with paypal when you receive too many gifts The gp is usually sold to very trusted people, who have been in the business for a long time.

Well even if someone quits rs they can still sell the gp for $ to prevent paypal chargebacks. There are always risks involved when you buy an account, even when the email is changed and you know previous passwords etc. For goldfarmers its balancing the cost vs how much can you make with this account p/h, can I make profit after just a few days? For people actually playing the game and buying an account, and intending to keep the accounts longer, there's even a higher risk. I rather create my accounts myself and use services

By using vouchers: http://osbot.org/forum/forum-227/announcement-44-voucher-guide-explanation/

Order Form: Quests/Services you need: dragon slayer, fight arena, monkey maddness, fairy tale 1 Your Skype: flamezzztw2 Do you agree with my T.o.S: Yes

Ye its the same ip. If you don't want a chain ban get a proxy for one.

I can get you a $5 voucher for 2.3m. Skype: flamezzztw2

Quests/Services you need: plague, biohazard, tree gnome, tourist trap and grand tree Your Skype: flamezzztw2 Do you agree with my T.o.S: Yep EDIT: Service completed. Very fast thanks!

My god so much effort I'm personally more a fan of: don't touch the variables/methods starting with an underscore, if you do anyway it's your fault. Config? just pass a dict/map. But it's nice to see a good Builder example, been a while since I looked into design patterns

inventory.getItems() returns an array of items index it with length-1 to get the last Item object if length > 0 then use item.interact()

- What errors do you get? - I assume the source is public, where can I find it?

"this will make it impossible for JaGeX to check if you're a human or a robot" Please...

I briefly searched on amazon image search and found they offer this functionality in their app. I assume you already knew this. How is this different from the search options they offer in their app?

I'm not sure what you want to do with all walkable tiles in a global pathfinding system. You could create nodes at intersections: with as much detail as you like, you should create a script to assist you. Then you use A* to compute a path. To traverse the edges you either write your own local walking function or use the builtin one. Your web or whatever people call it is now just a list of nodes (tiles) and associated edges (undirected in this case), which you should indeed store in a file.

You should have access to the mouse api in your script, so you can use mouse.click(false) directly. You can not create a new mouse since that mouse doesn't have access to the bot instance and can therefore not inject mouse events.

There already is a mouse, no need to create a new one :p

So you want to find the k-shortest paths and based on 'experience' you pick one of them. This would result in a 'verteran' player always taking the same route right? Why not just find the k-shortest paths and take the shortest the most often?

Yes, the empty script. But given the task of the script is not trivial, chances are fagex will completely remove the task and thus the script breaks. If thats not the case then even when hooks break you could resort to CPU heavy computer vision algorithms (like SURF/SIFT), which would work even after minor object/npc changes. Now if there are no weird updates which break the script, and hooks work then obviously a script can be flawless.

Well you pass a Filter of a specific type to objects.filter, groundItems.filter, npcs.filter etc. A Filter has the method match, in which you specify when an object/npc/grounditem meets certain requirements. Using Java 8 lambda expressions (probably needs to be enabled in your IDE) you can specify this as: objects.filter(variable -> requirements) Which is the same as ( Java < 8 ): objects.filter( new Filter<RS2Object>() { public boolean match(RS2Object variable) { if (requirements) return true; else return false; } }); Each time you return true for a specific object/npc/grounditem it passes the filter and is added to the list, which will be returned

Looks like get(x,y) is gone (or it's new, still using the 2.3.58 api) But you can always use a filter: objects.filter(obj -> obj.getPosition().equals(trapPosition));

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).

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

Unplug your router or call your ISP? Or are you simply looking for a free vpn/proxy?

"Don't limit yourself to one language." I cannot emphasize this enough. There are plenty of amazing free online courses (MOOCs): Machine learning: https://www.coursera.org/learn/machine-learning (requirements: basic matlab programming, basic linear algebra) Other AI stuff with pathfinding etc: https://www.edx.org/course/artificial-intelligence-uc-berkeleyx-cs188-1x-0#! (took this course a while ago, highly recommend it) Crypto: https://www.coursera.org/course/crypto (might be too advanced, you do need some number theory to understand RSA and other algorithms) Many more are listed here: https://www.class-central.com/subject/cs

Do you have Java Runtime Environment (JRE) 8?

An even nicer and actually readable solution would be (if you want to use java 8 with lambda expressions): List<Item> food = inventory.filter( item -> item.hasAction("Eat") );