| http://www.w3.org/ns/prov#value | - A tree is a good example of the former and simply having a mobile occupy a tile would be an example of the latter.Take your initial problem that you posed:1 2 3 ......a.T......a = the starting point and T is a tree.The most elegant way to determine what path 'a' should take is to do A* from the start 'a' to the destination 'T' even though the tree is unwalkable.The way to do this is to make it app
|
