58 ms·
Interesting problem. First I thought that I would formulate the problem as finding a path that in every step minimizes the number of possible starting position
by nabla9 8y ago
Interesting problem.
First I thought that I would formulate the problem as finding a path that in every step minimizes the number of possible starting positions for the current travel length.
Then I thought about adversarial forest designer who would design a forest where following optimal path for lengths smaller than X produces solution that is not optimal overall. What kind of forest that would be? Do they exist?