3 ms·
That's funny, I understand it as the exact opposite. The fox is tasked with finding the shortest path that hits 100 points. This leads it to the closest high po
by s1artibartfast 5y ago
That's funny, I understand it as the exact opposite. The fox is tasked with finding the shortest path that hits 100 points. This leads it to the closest high point density area.
- Sniffnoy 5y agoBut the whole point is that the fox doesn't know actual distance, it only knows triangle distance.
- s1artibartfast 5y agoYeah, I think the the path length is calculated in terms of distance, but the patching requirement isn't a set distance.
- heavenlyblue 5y ago> The fox is tasked with finding the shortest path that hits 100 points. This is exactly what I said (breadth-first). Breadth first find shortest distances to all nodes in the neighbourhood.