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