The Longest Straight-Line Path on Earth: How the 32,089 km Route Without Touching Land Was Calculated

A Seemingly Simple Question with Extraordinary Complexity

If you started at a point on Earth's surface and traveled in a perfectly straight line without turning, how far could you go without touching land — or conversely, without crossing any body of water? It sounds like an idle thought experiment, but behind this question lies a formidable challenge involving complex geographic data processing and geometric computation. In 2018, an academic study used rigorous algorithms to provide a definitive answer, sparking widespread discussion on Hacker News.

What we call a "straight line" on a sphere is actually a Great Circle Path — the arc formed where a plane passing through the Earth's center intersects the surface. The great circle is a fundamental concept in spherical geometry: just as a straight line is the shortest distance between two points on a plane, a great circle arc is the shortest path between two points on a sphere. A great circle is defined as a circle whose center coincides with the Earth's center and whose radius equals the Earth's radius, dividing the planet into two equal hemispheres. The equator is the most familiar great circle, and all lines of longitude also form great circles. By contrast, all lines of latitude other than the equator are not great circles, which is why flying along a parallel is never the shortest route.

In aviation and maritime navigation, great circle routes are widely used. For example, flights from New York to London don't follow the seemingly intuitive east-west direction but instead curve northward past eastern Canada and near Greenland, because this great circle arc is actually shorter in three-dimensional spherical space. The mathematical expression of great circle paths involves the Haversine Formula from spherical trigonometry, which precisely calculates the great circle distance between any two points on a sphere. In essence, this problem is about finding an optimal solution under the constraints of spherical geometry.

The Longest Straight-Line Path Over Water: 32,089 km Across Three Oceans

The study's conclusion is astonishing: the longest straight-line path on Earth that stays entirely over water without touching any land starts near the southern coast of Pakistan and extends to the vicinity of Russia's Kamchatka Peninsula in the northeast.

This path spans approximately 32,089.7 kilometers, crossing the Indian Ocean, rounding the southern tip of Africa, passing through the South Atlantic, traversing the Drake Passage (the body of water between South America and Antarctica), and finally entering the Pacific Ocean. The Drake Passage lies between Cape Horn at the southern tip of South America and the South Shetland Islands of Antarctica, stretching roughly 800 to 1,000 kilometers wide. It serves as a critical waterway connecting the Atlantic and Pacific Oceans and is one of the most dangerous sailing waters on Earth, notorious for its extreme wind and wave conditions. The existence of the Drake Passage allows the Antarctic Circumpolar Current to flow unimpeded around Antarctica — the only ocean current on Earth not blocked by any continent, and one with major implications for global climate regulation. It is precisely because the Drake Passage provides this critical water corridor that the longest straight-line path can bypass South America without touching land.

The entire route forms a perfect great circle arc on the sphere, yet miraculously avoids every island and continent along the way. The very existence of this path speaks to the connectivity of Earth's oceans — the five major oceans (Pacific, Atlantic, Indian, Southern, and Arctic) essentially form one interconnected global ocean system, sometimes referred to as the "World Ocean." This connectivity is the foundation of Earth's climate system: the Thermohaline Circulation, often called the "global ocean conveyor belt," relies on the free flow of currents between oceans to transport heat from equatorial regions to higher latitudes, regulating global climate. This straight-line path spanning three oceans provides a vivid spatial-geometric demonstration of the ocean's remarkable interconnectedness.

This result actually validated a conjecture proposed by Reddit user Patrick Anderson in 2012. The 2018 study by Rohan Chabukswar and Kushal Mukherjee provided rigorous proof using a reproducible algorithm.

The Longest Straight-Line Path Over Land: 11,241 km from Lianyungang to Lisbon

Corresponding to the oceanic path is the longest straight line that stays entirely on land without touching any body of water — including oceans, lakes, and major river surfaces.

This path begins near Lianyungang, China and ends near Lisbon, Portugal, spanning approximately 11,241.1 kilometers. It crosses the entire Eurasian continent, passing through China, Mongolia, Kazakhstan, Russia, Ukraine, Poland, Germany, France, and several other countries.

It's not hard to understand why the land path is far shorter than the ocean path — approximately 71% of Earth's surface is covered by ocean, and the oceans are highly interconnected, especially in the Southern Hemisphere. Land, by contrast, is fragmented by numerous bodies of water that act as natural barriers. Even the largest landmass, Eurasia, is internally divided by major bodies of water such as the Caspian Sea, the Aral Sea, and Lake Baikal, as well as countless rivers, severely constraining pure overland straight-line paths. The enormous difference between the two (32,089 km vs. 11,241 km, nearly a 3:1 ratio) vividly reflects the asymmetric distribution of land and sea on Earth's surface.

The Technical Challenges Behind the Algorithm

What makes this problem truly fascinating is its computational complexity. While it appears to be a geography question, it is actually a high-difficulty spatial search optimization problem.

Why Brute-Force Search Is Infeasible

The most straightforward approach would be to iterate through all possible starting points and directions, calculating the uninterrupted length of water or land along each great circle path. But the number of sample points on Earth's surface is staggeringly large — gridding the Earth at 1 km intervals would yield approximately 510 million sample points, each with 360 degrees of directional choices. Performing a complete path check for every point and every direction would cause computational costs to explode, far beyond what any ordinary computer could handle.

How Branch and Bound Efficiently Prunes the Search Space

The study employed a Branch and Bound algorithm to dramatically reduce the search space. This is a classic optimization algorithm in operations research and computer science, first proposed by A.H. Land and A.G. Doig in 1960, originally for solving integer linear programming problems. The algorithm's core framework has two steps: "branching" systematically divides the solution space into subsets (subproblems), while "bounding" computes upper or lower bounds on the objective function for each subproblem. Here's how it worked in this study:

1. First, the Earth's surface is divided into large regional blocks, and direction angles are also discretized into intervals
2. A quick estimate is made of the maximum possible path length each region could produce
3. If a region's upper bound is already less than the current best known solution, that region is immediately eliminated
4. Promising regions are further subdivided, and the process repeats until the desired precision is achieved

Through this "pruning" strategy, the algorithm eliminates vast swaths of regions that cannot possibly yield better solutions, concentrating computational resources on truly promising areas to arrive at precise results within a reasonable time frame. In the worst case, branch and bound still requires examining all possibilities, but in practice it typically reduces computation by several orders of magnitude. This method is widely applied to NP-hard problems such as the Traveling Salesman Problem (TSP), the knapsack problem, job scheduling, and circuit design. This study successfully applied it to a continuous spherical geometry search scenario, demonstrating the algorithm's powerful versatility.

Geographic Data Precision Determines Result Credibility

The accuracy of the results depends heavily on the underlying geographic data. The study used a high-resolution coastline dataset provided by NOAA (National Oceanic and Atmospheric Administration), specifically the GSHHG (Global Self-consistent, Hierarchical, High-resolution Geography Database), maintained by Paul Wessel and Walter H.F. Smith. This dataset provides five levels of resolution (from coarse to full) and covers coastlines, lake boundaries, island outlines, and rivers. At its highest resolution, GSHHG can identify extremely small islands and very narrow waterways — critical for this study, since even grazing a tiny reef island would invalidate a path.

The higher the data resolution, the more precisely coastline details are captured, and the more credible the final results become. This reminds us that any seemingly definitive geographic conclusion is fundamentally tied to the precision assumptions of a specific dataset. It's worth noting that coastlines themselves exhibit fractal characteristics — as you zoom in, details keep increasing and the total length changes accordingly. This is the famous "Coastline Paradox," articulated by mathematician Benoît Mandelbrot in his study of fractal geometry. Consequently, the determination of whether a path "touches land" may differ subtly depending on the dataset's resolution.

Why This Kind of Problem Matters

At first glance, "the longest straight line on Earth" seems like little more than a fun trivia puzzle, but it reflects several deeper values.

A classic teaching case for spatial search optimization. The branch and bound concept is widely applied in path planning, combinatorial optimization, AI search, and more. This intuitive geographic problem makes an abstract algorithm tangible and verifiable. Learners can use this problem to intuitively understand how pruning transforms an intractable problem into a tractable one, and how the tightness of upper bound estimates directly affects algorithm efficiency.

A model of open science and community collaboration. From a grassroots conjecture on Reddit to a rigorous academic proof, this chain demonstrates how an idea can evolve from casual discussion into reproducible scientific results. In 2012, Patrick Anderson posted a path he had manually traced in Google Earth in a Reddit geography discussion — the post attracted widespread community attention but remained at the conjecture level, with no one able to prove it was truly the longest path. It took six more years before a formal study rigorously confirmed it, with technical communities like Hacker News serving as bridges for dissemination and discussion. This case vividly illustrates the power of Open Science and Citizen Science — the intuitions and discoveries of non-specialists, when rigorously validated by the academic community, can become formal scientific contributions.

A methodological reference for GIS and spatial computing. Even "simple" questions about the planet beneath our feet may require elegant algorithms and high-quality data to answer. In an era when Geographic Information Systems (GIS) and spatial computing are increasingly important — from high-definition maps for autonomous driving to spatial analysis in urban planning — this kind of research provides transferable approaches for processing large-scale geographic data, especially for conducting efficient search and optimization in continuous spaces.

Conclusion

From the 30,000+ kilometer oceanic straight line between Pakistan and the Kamchatka Peninsula to the overland straight line spanning the Eurasian continent, these results satisfy humanity's curiosity about extremes while showcasing how computational methods can transform vague intuitions into precise answers. The next time you casually draw a line across a map, you might recall — on this planet, the longest possible straight line has already been precisely found by an algorithm.