What's the best way to get the best walkable tile (which is the highlighted one) dynamically? This is not hard when the entity is 1x1 but when its larger it gets bit harder. I know we got DynamicCircularPathFinder but its painfully slow and wrong many times. I tried to backport an old script by Zalgo but could not get it to work.

 

http://pastebin.com/kaxySJPT

 

http://pastebin.com/84myWrSk

 

I can get the size & orientation then array thru all the postions the entity covers and array once more the area around those postions for tiles with 0 flag but I don't think that's an efficient or ideal way to do it.

Edited June 2, 201411 yr by Th3

sorry a little off topic but chatbox is down. how do i get my player skill stats in osbot 2?

 

client.getSkills().getLevel(Skill.ATTACK);

 

^ that no longer works

 

is it getSkills().getDynamic(Skill.ATTACK);

 

or getSkills().getStatic(Skill.ATTACK);

Edited June 2, 201411 yr by Jack

sorry a little off topic but chatbox is down. how do i get my player skill stats in osbot 2?

 

client.getSkills().getLevel(Skill.ATTACK);

 

^ that no longer works

skills.getStatic(Skill.ATTACK);

skills.getDynamic(Skill.ATTACK);

sorry

  dynamic changes and static stays the same

 

 

Edited June 2, 201411 yr by precise

sorry a little off topic but chatbox is down. how do i get my player skill stats in osbot 2?

 

client.getSkills().getLevel(Skill.ATTACK);

 

^ that no longer works

 

is it getSkills().getDynamic(Skill.ATTACK);

 

or getSkills().getStatic(Skill.ATTACK);

//current level

        skills.getDynamic(Skill.ATTACK);

//real level

        skills.getStatic(Skill.ATTACK);

//xp

        skills.getExperience(Skill.ATTACK);

How were you able to access the collision flags? I can't seem to figure it out

How were you able to access the collision flags? I can't seem to figure it out

int[][] flags = client.getClippingPlanes()[sI.client.getPlane()].getTileFlags();

Then get individual tile flag using local x/y index in the flag array.

 

@OP use a pathfinding algorithm to find a path from your position to the destination? Just map the current region and any un-walkable tiles can be set as blocking with the algorithm.

Edited June 7, 201411 yr by Swizzbeat

bi dijkstra

bi dijkstra

Why would you want to use that here? Wouldn't it be pointless considering he knows the destination and the heuristic would just make finding the path faster?

U need to loop neighbours, thats all. Idk why u need it.

U need to loop neighbours, thats all. Idk why u need it.

 

So looping through entity position neighbors is the way to go?