this post was submitted on 29 Aug 2023
674 points (97.9% liked)

xkcd

8710 readers
151 users here now

A community for a webcomic of romance, sarcasm, math, and language.

founded 1 year ago
MODERATORS
koraro@lemmy.world
674
xkcd #2821: Path Minimization (startrek.website)
submitted 1 year ago* (last edited 1 year ago) by The_Picard_Maneuver@startrek.website to c/xkcd@lemmy.world
41 comments fedilink hide all child comments
 

Link to comic: https://xkcd.com/2821/

you are viewing a single comment's thread
view the rest of the comments
[–] Jorgelino328@kbin.social 6 points 1 year ago (2 children)

Shouldn't the path that maximizes time have its line go through literally everywhere in the globe rather than just going around it once?

[–] GrimSheeper@lemmy.world 16 points 1 year ago (1 children)

Yes, but by then the ice cream has melted

[–] The_Picard_Maneuver@startrek.website 3 points 1 year ago

We need a calculation using the speed at which ice cream melts and the max distance he could walk.

[–] nergal@lemmy.world 2 points 1 year ago

The path that maximizes time would just be going back and forth and not approaching the endpoint.