Editing 2821: Path Minimization

Jump to: navigation, search

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 10: Line 10:
  
 
==Explanation==
 
==Explanation==
 +
{{incomplete|Created by WAITING AN HOUR BEFORE SWIMMING - Please change this comment when editing this page. Do NOT delete this tag too soon.}}
  
 
In this comic, it appears that Cueball, standing on shore, is observing a swimmer who is possibly (but not obviously) in distress. The comic illustrates five potential paths that can be taken to reach the swimmer, each with a different reason to make them viable, in the manner of demonstrating different optimal strategies that can be chosen.
 
In this comic, it appears that Cueball, standing on shore, is observing a swimmer who is possibly (but not obviously) in distress. The comic illustrates five potential paths that can be taken to reach the swimmer, each with a different reason to make them viable, in the manner of demonstrating different optimal strategies that can be chosen.
Line 24: Line 25:
  
 
You could also fulfill the criteria of reaching the target in finite, but arbitrarily long, time by following a {{w|random walk}}(+swim) or even follow a {{w|space-filling curve}} carefully chosen to be the maximally finite scenario. Or you could simply choose any path, and stop for an arbitrarily long time, or travel at a speed approaching zero. In the comic, however, a requirement for simplicity of path may dictate the use of something close to the opposing {{w|great-circle distance}}, or a variation that has a maximal swim-time even without ''undue'' time-wasting detours, and assume equal speeds of travel on all routes.
 
You could also fulfill the criteria of reaching the target in finite, but arbitrarily long, time by following a {{w|random walk}}(+swim) or even follow a {{w|space-filling curve}} carefully chosen to be the maximally finite scenario. Or you could simply choose any path, and stop for an arbitrarily long time, or travel at a speed approaching zero. In the comic, however, a requirement for simplicity of path may dictate the use of something close to the opposing {{w|great-circle distance}}, or a variation that has a maximal swim-time even without ''undue'' time-wasting detours, and assume equal speeds of travel on all routes.
 
Alternatively, the fifth path may be a joke playing on relativity. In special and general relativity, timelike geodesics (locally) maximize the proper time between spacetime events. In a spacetime diagram (in sufficiently nice coordinates), an upwards-directed vertical line would be such a geodesic. Under this interpretation, the fifth path isn't a path around the world or through space at all, but through spacetime.
 
  
 
The comic pokes fun at two famous physical/mathematical problems that are usually stated as happening on a beach. The first is the Lifeguard problem, which Richard Feynman, in his book ''QED'', uses to illustrate {{w|Fermat's principle}}, or principle of least time, which states that the path taken by a light ray between two given points is the path that can be traveled in the least time. This is closely related to {{w|Stationary-action principle}} for mechanical systems. In Feynman's words:
 
The comic pokes fun at two famous physical/mathematical problems that are usually stated as happening on a beach. The first is the Lifeguard problem, which Richard Feynman, in his book ''QED'', uses to illustrate {{w|Fermat's principle}}, or principle of least time, which states that the path taken by a light ray between two given points is the path that can be traveled in the least time. This is closely related to {{w|Stationary-action principle}} for mechanical systems. In Feynman's words:
  
 
''"Finding the path of least time for light is like finding the path of least time for a lifeguard running and then swimming to rescue a drowning victim: the path of least distance has too much water in it; the path of least water has too much sand in it; the path of least time is a compromise between the two."'' - ''Richard Feynman, QED - The Strange Theory of Light and Matter (1988, Princeton University Press), Chapter 2.''
 
''"Finding the path of least time for light is like finding the path of least time for a lifeguard running and then swimming to rescue a drowning victim: the path of least distance has too much water in it; the path of least water has too much sand in it; the path of least time is a compromise between the two."'' - ''Richard Feynman, QED - The Strange Theory of Light and Matter (1988, Princeton University Press), Chapter 2.''
 
It is also possible that the comic makes fun of Feynman's idea that a photon (Cueball) would take ''every'' path to reach its destination, including the one that goes around the Earth, so that the paths shown are all being taken instead of being options Cueball is considering (therefore he could bring an ice cream to the swimmer).
 
  
 
The second problem referenced in this comic is the [https://gametheory101.com/courses/game-theory-101/hotellings-game-and-the-median-voter-theorem Beach Vendor Problem], which is stated as follows. Suppose that on a long beach there are two ice cream vendors. Customers are uniformly distributed on the beach and each person will go get the ice cream at the closest vendor. Each vendor wants to maximize the number of customers that buy at their place. To minimize the customer's walking time, the optimal configuration would be to have one vendor at 1/4 of the beach length and the other at 3/4, but {{w|Hotelling's law}} predicts that the two shops will converge to the middle of the beach, in an attempt to steal as many customers as possible from the competition. This is a case of {{w|Nash equilibrium}} that is also related to the {{w|Median voter theorem}}. If the number of vendors is larger than 2, the problem may become [https://gametheory101.com/tag/hotellings-game/ considerably more complicated].
 
The second problem referenced in this comic is the [https://gametheory101.com/courses/game-theory-101/hotellings-game-and-the-median-voter-theorem Beach Vendor Problem], which is stated as follows. Suppose that on a long beach there are two ice cream vendors. Customers are uniformly distributed on the beach and each person will go get the ice cream at the closest vendor. Each vendor wants to maximize the number of customers that buy at their place. To minimize the customer's walking time, the optimal configuration would be to have one vendor at 1/4 of the beach length and the other at 3/4, but {{w|Hotelling's law}} predicts that the two shops will converge to the middle of the beach, in an attempt to steal as many customers as possible from the competition. This is a case of {{w|Nash equilibrium}} that is also related to the {{w|Median voter theorem}}. If the number of vendors is larger than 2, the problem may become [https://gametheory101.com/tag/hotellings-game/ considerably more complicated].

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)