Way to detect can a unit reach its destination?

[WereElf]

As the title suggests - is there any way for me to detect if a unit can reach its destination when issued a point?

 

[Chaosy]

edit: I misread the question, the rest of the post is useless..

Not directly, easiest way is to add issued units in a group and check distance between points.
OR
When an order is issued set some boolean to true. Then in a loop check if current order is equal to nothing and boolean is true.

I used the second solution in my http://www.hiveworkshop.com/forums/...system-269473/?prev=search=wander&d=list&r=20.

 

[WereElf]

Well, this may work, but I kind a want to prevent the action from happening at all if the destination can't be reached.
So I guess I'll just re-work the way I want things to happen...

 

[Chaosy]

WOPS I missed one keyword in your question. CAN reach destination not WHEN.
Let me re-answer.
My first idea would be to use a isPathable lib and then use a pathfinding formula from wikipedia/google to check.

 

[WereElf]

Well, I found a native "IsTerrainPathable", but it doesn't quite work the way I want it to.
When I put "pathingtype" = PATHING_TYPE_WALKABLE and do "if true - call BJDebugMsg("true")" else call BJDebugMsg("false")" - I'm always getting "false", besides on water.
When I use PATHING_TYPE_FLOATABILITY - I always get "true", besides on water.

When I googled it - I found something, that could help a bit, but not really:
Split my map into regions, and check in which region is the unit, and check which region its tying to reach. Then check a fixed boolean if it can go from its region to the picked region.

However, I have trees blocking the path on my map, so if some trees are destroyed - the path will become walkable, and I don't know how to check when it becomes walkable.

So I guess I'll just change the way my spell works xP

EDIT: since "IssuePointOrder" returns a boolean, I tried to see if it's true or false after I order the unit to move somewhere, but it was always true

EDIT 2: I have a really ridiculous idea ( which I'm not gonna apply, but gonna share it anyways ): I can link the trees together in a hashtable:
tree 1 is next to tree 2, 3 and 4 (has 3 neighbour trees); tree 2 is next to tree 1, 3, 5, 6 (4 neighbour trees); tree 3 is next to tree 1, 2, 4, 6, 7 (5 neighbour trees), etc...
And when a tree dies - I could check if a path has opened up, by trqcking the chain
But for obvious reasons that's insane

 

[Acutesharpness]

The warcraft path search engine uses the grid A* search technique, meaning every grid is linked as you said, those pink boxes that shows unpathable are cut and the remaining paths are stored in array or hash-tables I suspect but that is about the basics I ever know.

 

[SAUS]

The warcraft path search engine uses the grid A* search technique, meaning every grid is linked as you said, those pink boxes that shows unpathable are cut and the remaining paths are stored in array or hash-tables I suspect but that is about the basics I ever know.

It would be nice if we could access that data (2D array is a likely way to store it).

For IssuePointOrder, it will be false any time it would give you an error message when you are trying to issue the order yourself. EX: "Not enough mana" or "Can't target allies", etc. You can see where the order might fail by trying out the orders yourself in-game (perhaps with a dummy spell). I am not sure if move command ever gets stopped, so it might always be true.

As for the main question, I don't know how to do this.

 

[Elprede]

http://www.hiveworkshop.com/forums/triggers-scripts-269/pathfinding-system-183791/ may help solve your issue.