[heavenlyblue]

As I understood that is that the fox is looking for the longest path (e.g. distance defined by breadth-first search) and longest paths are usually the ones that lead you to treasure because treasure is hidden deep within levels

[s1artibartfast]

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.

[heavenlyblue]

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

[Sniffnoy]

But the whole point is that the fox doesn't know actual distance, it only knows triangle distance.

[s1artibartfast]

Yeah, I think the the path length is calculated in terms of distance, but the patching requirement isn't a set distance.

[aaron695]

> looking for the longest path

> "The Fox isn't trying to get 100 meters away - it's trying to get 100 triangles away."

Breadth-first search wouldn't be possible. If at each triangle the fox has ~2 options that's 2^100 to get to 100 triangles away

But if it did impossibly work out every journey, and then chose a random last node it would end up in camps more often.

Depth-first search shouldn't preference the camps, unless it gets dragged in from afar. But if it can only get dragged in really close to/in a camp, then it's about the same probability as the fox running past/through a camp anyway. And I would assume as a player you would see the fact it's pretty.

[heavenlyblue]

> If at each triangle the fox has ~2 options that's 2^100 to get to 100 triangles away

I don’t think you understand what Djikstra’s algorithm is. Breadth first doesn’t mean you have to always re-visit the same node more than once.