Distance between two points on the Moon

Question

Given latitude/longitude of two points on the Moon (lat1, lon1) and (lat2, lon2), compute the distance between the two points in kilometers, by using any formula that gives the same result as the haversine formula.

Input

Four integer values lat1, lon1, lat2, lon2 in degree (angle) or
four decimal values ϕ1, λ1, ϕ2, λ2 in radians.

Output

Distance in kilometers between the two points (decimal with any precision or rounded integer).

Haversine formula

$d = 2 r \arcsin\left(\sqrt{\sin^2\left(\frac{\phi_2 - \phi_1}{2}\right) + \cos(\phi_1) \cos(\phi_2)\sin^2\left(\frac{\lambda_2 - \lambda_1}{2}\right)}\right)$

where

r is the radius of the sphere (assume that the Moon's radius is 1737 km),
ϕ1 latitude of point 1 in radians
ϕ2 latitude of point 2 in radians
λ1 longitude of point 1 in radians
λ2 longitude of point 2 in radians
d is the circular distance between the two points

(source: https://en.wikipedia.org/wiki/Haversine_formula)

Other possible formulas

d = r * acos(sin ϕ1 sin ϕ2 + cos ϕ1 cos ϕ2 cos(λ2 - λ1)) @miles' formula.
d = r * acos(cos(ϕ1 - ϕ2) + cos ϕ1 cos ϕ2 (cos(λ2 - λ1) - 1)) @Neil's formula.

Example where inputs are degrees and output as rounded integer

42, 9, 50, 2  --> 284
50, 2, 42, 9  --> 284
4, -2, -2, 1  --> 203
77, 8, 77, 8  --> 0
10, 2, 88, 9  --> 2365

Rules

The input and output can be given in any convenient format.
Specify in the answer whether the inputs are in degrees or radians.
No need to handle invalid latitude/longitude values
Either a full program or a function are acceptable. If a function, you can return the output rather than printing it.
If possible, please include a link to an online testing environment so other people can try out your code!
Standard loopholes are forbidden.
This is code-golf so all usual golfing rules apply, and the shortest code (in bytes) wins.

Using that particular formula is an unobservable requirement. Isn't it enough to give the same result as that formula would give? — Adám, Apr 10 '18 at 14:00
@mdahmoune OK, so you listed in degrees for ease of writing, but may we require input to be in radians? Otherwise this challenge becomes a combo (which is bad) of angle conversion and of the main challenge. — Adám, Apr 10 '18 at 14:11
I've downvoted this question because it seems more to be 'Who's language can golf this formula the most', which, in my opinion, isn't particularly interesting. — caird coinheringaahing, Apr 10 '18 at 15:27
A shorter formula for most languages would be d = r * acos( sin ϕ1 sin ϕ2 + cos ϕ1 cos ϕ2 cos(λ2 - λ1) ) where r = 1737 — miles, Apr 10 '18 at 17:35

miles · Accepted Answer · 2018-04-10 17:52:30Z

6

Wolfram Language (Mathematica), 48 bytes

ArcCos[Sin@#*Sin@#3+Cos[#2-#4]Cos@#*Cos@#3]1737&

Try it online!

Uses the formula d = r * acos( sin ϕ1 sin ϕ2 + cos ϕ1 cos ϕ2 cos(λ2 - λ1) ) where r = 1737

answered Apr 10 '18 at 17:52

miles

16.1k2 gold badges24 silver badges93 bronze badges

Add a comment |

Giuseppe · Accepted Answer · 2018-04-10 18:49:54Z

6

R + geosphere, 54 47 bytes

function(p,q)geosphere::distHaversine(p,q,1737)

Try it online!

Takes input as 2-element vectors of longitude,latitude in degrees. TIO doesn't have the geosphere package but rest assured that it returns identical results to the function below.

Thanks to Jonathan Allan for shaving off 7 bytes.

R, 64 bytes

function(p,l,q,k)1737*acos(sin(p)*sin(q)+cos(p)*cos(q)*cos(k-l))

Try it online!

Takes 4 inputs as in the test cases, but in radians rather than degrees.

edited Apr 10 '18 at 18:49

answered Apr 10 '18 at 18:07

Giuseppe

23.3k3 gold badges27 silver badges91 bronze badges

\$\begingroup\$ Are the e3 and /1000 really necessary? \$\endgroup\$
– Jonathan Allan
Apr 10 '18 at 18:45
1

\$\begingroup\$ @JonathanAllan no they are not. That's pretty dumb of me, but the default argument for the radius is the earth's in meters so it was logical at the time, lol \$\endgroup\$
– Giuseppe
Apr 10 '18 at 18:46
\$\begingroup\$ Note that the spherical law of cosines is not numerically stable, in particular for small distances. That's probably ok in Mathematica, but in R and most other languages it's debatable whether the "any formula that gives the same result as the haversine formula" criterion is fulfilled. \$\endgroup\$
– ceased to turn counterclockwis
Apr 10 '18 at 22:11
\$\begingroup\$ @ceasedtoturncounterclockwis I mostly included it for the sake of having it in base R. I suppose using an arbitrary precision floating point library would mitigate the effect. \$\endgroup\$
– Giuseppe
Apr 10 '18 at 22:17
\$\begingroup\$ Yes, or using a stable formula like, say, the haversine formula... \$\endgroup\$
– ceased to turn counterclockwis
Apr 10 '18 at 22:18

Add a comment |

Olivier Grégoire · Accepted Answer · 2018-04-11 09:17:10Z

5

JavaScript (Node.js), 65 bytes

(a,b,c,d,C=Math.cos)=>1737*Math.acos(C(a-c)+C(a)*C(c)*(C(d-b)-1))

Try it online!

Based on Kevin Cruijssen's answer, Miles' and Neil's comments, and upon request of Arnauld.

answered Apr 11 '18 at 9:17

Olivier Grégoire

13.1k3 gold badges26 silver badges53 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

5

JavaScript (ES7), 90 bytes

Note: see @OlivierGrégoire's post for a much shorter solution

A direct port of TFeld's answer. Takes input in radians.

(a,b,c,d,M=Math)=>3474*M.asin((M.sin((c-a)/2)**2+M.cos(c)*M.cos(a)*M.sin((d-b)/2)**2)**.5)

Try it online!

Using the infamous `with()`, 85 bytes

Thanks to @l4m2 for saving 6 bytes

with(Math)f=(a,b,c,d)=>3474*asin((sin((c-a)/2)**2+cos(c)*cos(a)*sin((d-b)/2)**2)**.5)

Try it online!

edited Jun 17 '20 at 9:04

CommunityBot

1

answered Apr 10 '18 at 14:36

Arnauld

157k14 gold badges155 silver badges562 bronze badges

2

\$\begingroup\$ You can do with(Math)f=(a,b,c,d)=>3474*asin((sin((c-a)/2)**2+cos(c)*cos(a)*sin((d-b)/2)**2)**.5) \$\endgroup\$
– l4m2
Apr 10 '18 at 16:29
\$\begingroup\$ 77 bytes using @miles' shorter algorithm: (a,b,c,d,M=Math)=>1737*M.acos(M.sin(a)*M.sin(c)+M.cos(a)*M.cos(c)*M.cos(d-b)) \$\endgroup\$
– Kevin Cruijssen
Apr 11 '18 at 7:12
1

\$\begingroup\$ 74 bytes using @Neil's shorter algorithm: (a,b,c,d,M=Math)=>1737*M.acos(M.cos(a-c)+M.cos(a)*M.cos(c)*(M.cos(d-b)-1)) \$\endgroup\$
– Kevin Cruijssen
Apr 11 '18 at 8:34
3

\$\begingroup\$ 65 bytes optimizing everybody's answer: (a,b,c,d,C=Math.cos)=>1737*Math.acos(C(a-c)+C(a)*C(c)*(C(d-b)-1)) \$\endgroup\$
– Olivier Grégoire
Apr 11 '18 at 8:37
\$\begingroup\$ @OlivierGrégoire Very nice. You probably should post it as a new answer. \$\endgroup\$
– Arnauld
Apr 11 '18 at 8:50

Add a comment |

Adám · Accepted Answer · 2018-04-11 12:55:10Z

APL (Dyalog Unicode), 40 35 bytes^SBCS

Anonymous tacit function. Takes {ϕ₁,λ₁} as left argument and {ϕ₂,λ₂} as right argument.

Uses the formula 2 r √(sin²(^{(ϕ₁-ϕ₂)}⁄₂) + cos ϕ₁ cos ϕ₂ sin²(^{(λ₁ – λ₂)}⁄₂))

3474×¯1○.5*⍨1⊥(×⍨1○2÷⍨-)×1,2×.○∘⊃,¨

Try it online! (the r function converts degrees to radians)

,¨ concatenate corresponding elements; {{ϕ₁ , ϕ₂} , {λ₁ , λ₂}}

⊃ pick the first; {ϕ₁ , ϕ₂}

∘ then

2×.○ product of their cosines; cos ϕ₁ cos ϕ₂
^{lit. dot "product" but with trig function selector (2 is cosine) instead of multiplication and times instead of plus}

1, prepend 1 to that; {1 , cos ϕ₁ cos ϕ₂}

(…)× multiply that by the result of applying following function to {ϕ₁ , λ₁} and {ϕ₂ , λ₂}:

- their differences; {ϕ₁ - ϕ₂ , λ₁ - λ₂}

2÷⍨ divide that by 2; {^{(ϕ₁ - ϕ₂)}⁄₂ , ^{(λ₁ - λ₂)}⁄₂}

1○ sine of that; {sin(^{(ϕ₁ - ϕ₂)}⁄₂) , sin(^{(λ₁ - λ₂)}⁄₂)}

×⍨ square that (lit. self-multiply); {sin²(^{(ϕ₁ - ϕ₂)}⁄₂) , sin²(^{(λ₁-λ₂)}⁄₂)}

Now we have {sin²(^{(ϕ₁ - ϕ₂)}⁄₂) , cos ϕ₁ cos ϕ₂ sin²(^{(λ₁ - λ₂)}⁄₂)}

1⊥ sum that (lit. evaluate in base-1); sin²(^{(ϕ₁-ϕ₂)}⁄₂) + cos ϕ₁ cos ϕ₂ sin²(^{(λ₁ - λ₂)}⁄₂)

.5*⍨ square-root of that (lit. raise that to the power of a half)

¯1○ arcsine of that

3474× multiply that by this

The function to allow input in degrees is:

○÷∘180

÷180 argument divided by 180

○ multiply by π

TFeld · Accepted Answer · 2018-04-10 14:24:04Z

4

Python 2, 95 bytes

lambda a,b,c,d:3474*asin((sin((c-a)/2)**2+cos(c)*cos(a)*sin((d-b)/2)**2)**.5)
from math import*

Try it online!

Takes input in radians.

Old version, before i/o was slacked: Takes input as integer degrees, and returns rounded dist

Python 2, 135 bytes

lambda a,b,c,d:int(round(3474*asin((sin((r(c)-r(a))/2)**2+cos(r(c))*cos(r(a))*sin((r(d)-r(b))/2)**2)**.5)))
from math import*
r=radians

Try it online!

edited Apr 10 '18 at 14:24

answered Apr 10 '18 at 14:15

TFeld

19.6k3 gold badges17 silver badges61 bronze badges

\$\begingroup\$ you can drop int and round because decimals are allowed as output, you can also avoid conversion to radians because inputs as radians are also allowed \$\endgroup\$
– mdahmoune
Apr 10 '18 at 14:20
\$\begingroup\$ @mdahmoune, Thanks, updated \$\endgroup\$
– TFeld
Apr 10 '18 at 14:26

Add a comment |

Etheryte · Accepted Answer · 2020-06-04 16:59:35Z

Japt, 55 50 bytes

MsU *MsW +McU *McW *McX-V
ToMP1/7l¹ñ@McX aUÃv *#7

Not necessarily quite as precise as the other answers, but boy did I have fun with this one. Allow me to elaborate.
While in most languages, this challenge is quite straightforward, Japt has the unfortunate property that there is no built-in for neither arcsine nor arccosine. Sure, you can embed Javascript in Japt, but that would be what ever the opposite of Feng Shui is.

All we have to do to overcome this minor nuisance is approximate arccosine and we're good to go!

The first part is everything that gets fed into the arccosine.

MsU *MsW +McU *McW *McX-V
MsU                        // Take the sine of the first input and
    *MsW...                // multiply by the cos of the second one etc.

The result is implicitly stored in U to be used later.

Following that, we need to find a good approximation for arccosine. Since I'm lazy and not that good with math, we're obviously just going to brute-force it.

ToMP1/7l¹ñ@McX aUÃv *#7
T                       // Take 0
 o                      // and create a range from it
  MP                    // to π
    1/7l¹               // with resolution 1/7!.
         ñ@             // Sort this range so that
           McX          // the cosine of a given value
               aU       // is closest to U, e.g. the whole trig lot
                        // we want to take arccosine of.
                 Ã      // When that's done,
                  v     // get the first element
                    *#7 // and multiply it by 1737, returning implicitly.

We could've used any large number for the generator resolution, manual testing showed 7! is sufficiently large while being reasonably fast.

Takes input as radians, outputs unrounded numbers.

Shaved off five bytes thanks to Oliver.

Try it online!

You can remove the ( in Mc(X-V. Since the char-code for 1737 isn't ISO-8859-1, it switches to UTF-8, which costs more. You can instead use the char-code for 173+7. ethproductions.github.io/japt/?v=1.4.5&code=I603&input= — Oliver, Apr 11 '18 at 16:19
@Oliver Thanks a lot, the parenthesis were necessary in my original version but became obsolete when golfing it around a bit, I completely missed it though. Also, didn't know about the encoding thing, thanks a lot for that, too. — Etheryte, Apr 11 '18 at 18:04
If you do want to go the JavaScript route, keep in mind that you can run everything through shoco. — Oliver, Apr 11 '18 at 19:45

Community · Accepted Answer · 2020-06-17 09:04:33Z

3

Java 8, 113 92 88 82 bytes

(a,b,c,d)->1737*Math.acos(Math.cos(a-c)+Math.cos(a)*Math.cos(c)*(Math.cos(d-b)-1))

Inputs a,b,c,d are ϕ1,λ1,ϕ2,λ2 in radians.

-21 bytes using @miles' shorter formula.
-4 bytes thanks to @OlivierGrégore because I still used {Math m=null;return ...;} with every Math. as m., instead of dropping the return and use Math directly.
-6 bytes using @Neil's shorter formula.

Try it online.

Explanation:

(a,b,c,d)->                  // Method with four double parameters and double return-type
  1737*Math.acos(            //  Return 1737 multiplied with the acos of:
   Math.cos(a-c)             //   the cos of `a` minus `c`,
   +Math.cos(a)*Math.cos(c)  //   plus the cos of `a` multiplied with the cos of `c`
   *(Math.cos(d-b)-1))       //   multiplied with the cos of `d` minus `b` minus 1

edited Jun 17 '20 at 9:04

CommunityBot

1

answered Apr 10 '18 at 15:06

Kevin Cruijssen

90.5k8 gold badges120 silver badges313 bronze badges

1

\$\begingroup\$ "Premature optimization is the root of all evil"! 88 bytes: (a,b,c,d)->1737*Math.acos(Math.sin(a)*Math.sin(c)+Math.cos(a)*Math.cos(c)*Math.cos(d-b)) \$\endgroup\$
– Olivier Grégoire
Apr 11 '18 at 8:04
\$\begingroup\$ "Premature optimization is the root of all evil" I guess you're indeed right.. Thanks! \$\endgroup\$
– Kevin Cruijssen
Apr 11 '18 at 8:26
1

\$\begingroup\$ I've found a shorter formulation: (a,b,c,d)->1737*Math.acos(Math.cos(a-c)+Math.cos(a)*Math.cos(c)*(Math.cos(d-b)-1)) \$\endgroup\$
– Neil
Apr 11 '18 at 8:27
\$\begingroup\$ (That formulation isn't shorter in the original Wolfram Language though.) \$\endgroup\$
– Neil
Apr 11 '18 at 8:31

Add a comment |

Asone Tuhid · Accepted Answer · 2018-04-12 23:03:50Z

3

Haskell, 68 66 52 51 bytes

s=cos;(a!b)c d=1737*acos(s(a-c)+s a*s c*(s(d-b)-1))

Try it online!

-1 byte thanks to BMO

edited Apr 12 '18 at 23:03

answered Apr 10 '18 at 16:01

Asone Tuhid

2,1825 silver badges22 bronze badges

Add a comment |

Asone Tuhid · Accepted Answer · 2020-06-02 22:33:24Z

3

Ruby, 87 70 69 68 bytes

->{extend Math;1737*acos(cos(_1-_3)+cos(_1)*cos(_3)*(cos(_4-_2)-1))}

Unfortunately, TIO doesn't support `_1` syntax so for TIO, 69 bytes

->a,b,c,d{extend Math;1737*acos(cos(a-c)+cos(a)*cos(c)*(cos(d-b)-1))}

Try it online!

Now using Neil's method, thanks to Kevin Cruijssen.

edited Jun 2 '20 at 22:33

answered Apr 10 '18 at 15:19

Asone Tuhid

2,1825 silver badges22 bronze badges

\$\begingroup\$ Using Neil's formula is 17 bytes shorter: ->a,b,c,d{include Math;1737*acos(cos(a-c)+cos(a)*cos(c)*(cos(d-b)-1))} \$\endgroup\$
– Kevin Cruijssen
Apr 12 '18 at 14:11

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

2

Jelly, 23 22 18 bytes

-4 bytes thanks to miles (use of { and } while using their formula.

;I}ÆẠP+ÆSP${ÆA×⁽£ġ

A dyadic function accepting [ϕ1, ϕ2,] on the left and [λ1, λ2] on the right in radians that returns the result (as floating point).

Try it online!

Mine... (also saved a byte here by using a {)

,IÆẠCH;ÆẠ{Ḣ+PƊ½ÆṢ×⁽µṣ

Try it online

edited Jun 17 '20 at 9:04

CommunityBot

1

answered Apr 10 '18 at 17:58

Jonathan Allan

85.8k7 gold badges58 silver badges238 bronze badges

\$\begingroup\$ Oh interesting, I refreshed the page again and it showed your edit, just clicking new answer to show the change doesn't update to show your edits. the 18 byte alternative was ;I}ÆẠP+ÆSP${ÆA×⁽£ġ \$\endgroup\$
– miles
Apr 10 '18 at 19:01
\$\begingroup\$ Never understood how to use { and } they never do what I'd expect. Doesn't that mean I can do the other way in 17?! \$\endgroup\$
– Jonathan Allan
Apr 10 '18 at 19:04
\$\begingroup\$ Maybe. { and } just create a dyad from a monad. A similar view might be P{ -> ḷP¥. Might be good to add a compose (from J) quick to do something like x (P+$) y -> (P x) + (P y) which can save a byte or two in similar situations. \$\endgroup\$
– miles
Apr 10 '18 at 19:24

Add a comment |

Luis Mendo · Accepted Answer · 2018-04-10 22:01:09Z

2

MATLAB with Mapping Toolbox, 26 bytes

@(x)distance(x{:})*9.65*pi

Anonymous function that takes the four inputs as a cell array, in the same order as described in the challenge.

Note that this gives exact results (assuming that the Moon radius is 1737 km), because 1737/180 equals 9.65.

Example run in Matlab R2017b:

edited Apr 10 '18 at 22:01

answered Apr 10 '18 at 21:13

Luis Mendo

96.9k9 gold badges115 silver badges344 bronze badges

Add a comment |

RootTwo · Accepted Answer · 2018-04-10 23:28:09Z

1

Python 3, 79 bytes

from geopy import*
lambda a,b:distance.great_circle(a,b,radius=1737).kilometers

TIO doesn't have geopy.py

answered Apr 10 '18 at 23:28

RootTwo

1,9686 silver badges7 bronze badges

2

\$\begingroup\$ @Nit, my understanding is that it is fair game to use a publicly available library that predates the question. I thinks it's like using MATLAB's mapping tools, or other languages using a math library. \$\endgroup\$
– RootTwo
Apr 11 '18 at 2:39

Add a comment |

Adám · Accepted Answer · 2018-04-11 12:47:21Z

APL (Dyalog Unicode), 29 bytes^SBCS

Complete program. Prompts stdin for {ϕ₁,ϕ₂} and then for {λ₁,λ₂}. Prints to stdout.

Uses the formula r acos(sin ϕ₁ sin ϕ₂ + cos(λ₂ – λ₁) cos ϕ₁ cos ϕ₂)

1737×¯2○+/(2○-/⎕)×@2×/1 2∘.○⎕

Try it online! (the r function converts degrees to radians)

⎕ prompt for {ϕ₁,ϕ₂}

1 2∘.○ Cartesian trig-function application; {{sin ϕ₁,sin ϕ₂} , {cos ϕ₁,cos ϕ₂}}

×/ row-wise products; {sin ϕ₁ sin ϕ₂ , cos ϕ₁ cos ϕ₂}

(…)×@2 at the second element, multiply the following by that:

⎕ prompt for {λ₁,λ₂}

-/ difference between those; λ₁ – λ₂

2○ cosine of that; cos(λ₁ – λ₂)

Now we have {sin ϕ₁ sin ϕ₂ , cos(λ₁ – λ₂) cos ϕ₁ cos ϕ₂}

+/ sum; sin ϕ₁ sin ϕ₂ + cos(λ₁ – λ₂) cos ϕ₁ cos ϕ₂

¯2○ cosine of that; cos(sin ϕ₁ sin ϕ₂ + cos(λ₁ – λ₂) cos ϕ₁ cos ϕ₂)

1737× multiply r by that; 1737 cos(sin ϕ₁ sin ϕ₂ + cos(λ₁ – λ₂) cos ϕ₁ cos ϕ₂)

The function to allow input in degrees is:

○÷∘180

÷180 argument divided by 180

○ multiply by π

jxh · Accepted Answer · 2018-04-11 18:13:58Z

1

C (gcc), 100 88 65 64 bytes

88 → 65 using @miles' formula
65 → 64 using @Neil's formula

#define d(w,x,y,z)1737*acos(cos(w-y)+cos(w)*cos(y)*(cos(z-x)-1))

Try it online!

edited Apr 11 '18 at 18:13

answered Apr 10 '18 at 22:44

jxh

3413 silver badges9 bronze badges

\$\begingroup\$ I believe you need to add two bytes for the -lm compiler flag. \$\endgroup\$
– O.O.Balance
Apr 11 '18 at 12:35
\$\begingroup\$ @O.O.Balance: The presence of the flag is not always required. It depends on how the compiler was installed on the system. \$\endgroup\$
– jxh
Apr 11 '18 at 14:37
\$\begingroup\$ Alright. Guess this means I can subtract two bytes on this answer of mine: codegolf.stackexchange.com/a/161452/79343 Thanks. \$\endgroup\$
– O.O.Balance
Apr 11 '18 at 15:22
\$\begingroup\$ @O.O.Balance: Upvoted the answer. I also submitted my own solution. \$\endgroup\$
– jxh
Apr 11 '18 at 21:31
\$\begingroup\$ Nice. Upvoted yours as well. \$\endgroup\$
– O.O.Balance
Apr 11 '18 at 22:23

Add a comment |

Wernisch · Accepted Answer · 2018-04-12 10:38:54Z

1

Excel, 53 bytes

=1737*ACOS(COS(A1-C1)+COS(A1)*COS(C1)*(COS(D1-B1)-1))

Using @Neil's formula. Input in Radians.

answered Apr 12 '18 at 10:38

Wernisch

2,8166 silver badges21 bronze badges

Add a comment |

Panda0nEarth · Accepted Answer · 2018-04-12 13:55:27Z

1

Lobster, 66 bytes

def h(a,c,b,d):1737*radians arccos a.sin*b.sin+a.cos*b.cos*cos d-c

Uses miles's formula, but input is in degrees. This adds extra step of converting to radians before multiplying by radius.

answered Apr 12 '18 at 13:55

Panda0nEarth

1113 bronze badges

Add a comment |

mbomb007 · Accepted Answer · 2018-04-12 14:25:22Z

1

Python 3, 119 103 bytes

This uses degrees.

from math import*
def f(L):a,o,A,O=map(radians,L);return 1737*acos(cos(a-A)+cos(a)*cos(A)*(cos(O-o)-1))

Try it online!

edited Apr 12 '18 at 14:25

answered Apr 10 '18 at 14:29

mbomb007

22.6k6 gold badges54 silver badges131 bronze badges

\$\begingroup\$ Using Neil's formula is 16 bytes shorter: 1737*acos(cos(a-A)+cos(a)*cos(A)*(cos(O-o)-1)) \$\endgroup\$
– Kevin Cruijssen
Apr 12 '18 at 14:09

Add a comment |

Luis felipe De jesus Munoz · Accepted Answer · 2018-07-11 12:47:20Z

1

PHP, 88 bytes

Port of Oliver answer

function f($a,$b,$c,$d,$e=cos){return 1737*acos($e($a-$c)+$e($a)*$e($c)*($e($d-$b)-1));}

Try it online!

answered Jul 11 '18 at 12:47

Luis felipe De jesus Munoz

9,8072 gold badges22 silver badges78 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

SmileBASIC, 60 bytes

INPUT X,Y,S,T?1737*ACOS(COS(X-S)+COS(X)*COS(S)*(COS(T-Y)-1))

edited Jun 17 '20 at 9:04

CommunityBot

1

answered Jan 22 '19 at 0:41

12Me21

6,4001 gold badge18 silver badges37 bronze badges

Add a comment |

the default. · Accepted Answer · 2020-06-04 17:14:07Z

1

Wolfram Language (Mathematica), 66 bytes

Clearly the other Wolfram Language golfers only care about bytes. This program uses the beauty of Mathematica.

GeoDistance@@Map[#~GeoPosition~Entity["PlanetaryMoon","Moon"]&,#]&

Either I am misusing TIO, or it doesn't work there. This works on my machine, though.

answered Jun 4 '20 at 17:14

the default.

7,9941 gold badge29 silver badges60 bronze badges

Add a comment |

Distance between two points on the Moon

Input

Output

Haversine formula

Other possible formulas

Example where inputs are degrees and output as rounded integer

Rules

21 Answers 21

Wolfram Language (Mathematica), 48 bytes

R + geosphere, 54 47 bytes

R, 64 bytes

JavaScript (Node.js), 65 bytes

JavaScript (ES7), 90 bytes

Using the infamous with(), 85 bytes

APL (Dyalog Unicode), 40 35 bytesSBCS

Python 2, 95 bytes

Python 2, 135 bytes

Japt, 55 50 bytes

Java 8, 113 92 88 82 bytes

Haskell, 68 66 52 51 bytes

Ruby, 87 70 69 68 bytes

Unfortunately, TIO doesn't support _1 syntax so for TIO, 69 bytes

Jelly, 23 22 18 bytes

MATLAB with Mapping Toolbox, 26 bytes

Python 3, 79 bytes

APL (Dyalog Unicode), 29 bytesSBCS

C (gcc), 100 88 65 64 bytes

Excel, 53 bytes

Lobster, 66 bytes

Python 3, 119 103 bytes

PHP, 88 bytes

SmileBASIC, 60 bytes

Wolfram Language (Mathematica), 66 bytes

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golf math geometry trigonometry or ask your own question.

Linked

Related

Hot Network Questions

Using the infamous `with()`, 85 bytes

APL (Dyalog Unicode), 40 35 bytes^SBCS

Unfortunately, TIO doesn't support `_1` syntax so for TIO, 69 bytes

APL (Dyalog Unicode), 29 bytes^SBCS