Authors: Philip Gibbs
Sixty years ago Richard Bellman issued a difficult challenge to his fellow mathematicians. If a rambler is lost in a forest of known shape and size, how can she find the best path to follow in order to escape as quickly as possible? So far solutions are only known for a handful of simple cases and the general problem has therefore been described as “unapproachable.” In this work a computational “random paths” method to search for optimal escape paths inside convex polygonal forests is described. In particular likely solutions covering all cases of isosceles triangles are given. Each conjectured solution provides a potentisl upper-bound for Moser’s worm problem. Surprisingly there are two cases of triangles which would provide improvements on the best known proven upper bounds.
Comments: Pages. DOI: 10.13140/RG.2.2.13171.12325
[v1] 2016-07-02 02:33:06
Unique-IP document downloads: 79 times
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.