Bellman’s lost-in-a-forest problem
For a forest of known shape, what path guarantees escape in the shortest worst-case distance, starting from an unknown point facing an unknown direction?
Summary
Richard Bellman posed the problem in 1955. Optimal escape paths are known for some shapes, such as discs, regular polygons with more than three sides and infinite strips, but there is no known method for an arbitrary shape; the problem is linked to Moser’s worm problem.
Source
Open, as listed by Wikipedia · Unsolved problems in mathematics. Checked 18 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.