  There has been some interest recently in determining the longest distance one
can sail for on the earth without hitting land, as well as in the converse
problem of determining the longest distance one could drive for on the earth
without encountering a major body of water. In its basic form, this is an
optimisation problem, rendered chaotic by the presence of islands and lakes,
and indeed the fractal nature of the coasts. In this paper we present a
methodology for calculating the two paths using the branch-and-bound algorithm.
