The paper titled Longest Straight Line Paths on Water or Land on the Earth was submitted to the arXiv repository in April 2018 and subsequently revised in July 2018. It appears in the Mathematics > History and Overview category. The authors note that there has been recent interest in two related optimisation problems: determining the greatest distance one can sail on Earth without encountering land, and determining the greatest distance one could drive without meeting a major body of water. Both problems are complicated by the presence of islands, lakes, and the fractal nature of coastlines, which make the search space highly irregular and chaotic. To address this complexity, the researchers propose a methodology based on the branch‑and‑bound algorithm. This algorithm systematically explores possible routes, pruning those that cannot possibly exceed the best solution found so far, thereby converging on the optimal longest straight‑line segment that stays entirely within water or entirely within land. The paper does not provide the actual numerical lengths of the routes; instead, it focuses on the computational approach that makes the calculation feasible despite the intricate geography of the planet. By framing the problem as an optimisation task and applying a well‑known combinatorial technique, the work offers a reproducible method for others to compute these extreme paths using updated coastline data or different resolution models. The submission history shows four versions, with the final version uploaded on 2 July 2018, indicating that the authors incorporated feedback and made adjustments to the presentation and technical details. The paper contributes to a niche intersection of geography, computational geometry, and recreational mathematics, providing a clear algorithmic pipeline for a question that has intrigued both amateur enthusiasts and researchers interested in the geometry of Earth’s surface.
