Difference between revisions of "Talk:1580: Travel Ghost"

Explain xkcd: It's 'cause you're dumb.
Jump to: navigation, search
Line 16: Line 16:
  
 
Is this the first time Cueballs children were shown? [[User:ẞ qwertz|ẞ qwertz]] ([[User talk:ẞ qwertz|talk]]) 17:22, 21 September 2015 (UTC)
 
Is this the first time Cueballs children were shown? [[User:ẞ qwertz|ẞ qwertz]] ([[User talk:ẞ qwertz|talk]]) 17:22, 21 September 2015 (UTC)
 +
 +
I don't know if it's worth mentioning that this appears to be a width-first (route-)search algorithm.  A memory-heavy but guaranteed 'perfect' solver of best routing, at every point of choice (from the very first, how you start the journey), all possible/practical travel options are explored (including taking a journey in the 'wrong' direction, or waiting for the non-stop train that is not the first to arrive, to take advantage of connections with faster transport links), in parallel according to the total time (or other measure of efficiency) yet taken on each iteration.  Unless any 'ghost' arrives at a node that has already been visited by a 'ghost', when it need not continue.  Eventually, the most efficient son-of-a-son-of-a-son...-of-a-son-of-a-ghost will reach the destination, indicating the 'correct' answer.  At least within the limits of the split-and-propogate algorithm, and the amount of parallelisation available to devote to the problem.  (See also the multiple-overlayed 'searches' performed by two-minutes-of-Nicholas Cage, in the near-climactic scene in {{w|Next_(2007_film)|the film 'Next' (beware spoilers!)}}.) [[Special:Contributions/141.101.99.12|141.101.99.12]] 22:38, 21 September 2015 (UTC)

Revision as of 22:38, 21 September 2015

Racing Ghosts is a refference to Mario Kart ẞ qwertz (talk) 12:50, 21 September 2015 (UTC)

This seems like a bit of a stretch to me. 173.245.55.118 13:35, 21 September 2015 (UTC)
It's not a reference to Mario Kart specifically (lots of racing games have ghosts), but that's basically what this is doing - translating the concept of racing ghosts to the real world.--108.162.216.70 13:50, 21 September 2015 (UTC)
Well, there are some fitness running apps that support a ghost runner mode, so you run against your best time and get updates if you are in front or behind of your „ghost“. Without actually being able to prove it, I believe (and always assumed) this idea is actually inspired from racing games like Mario Kart. 162.158.115.36 13:56, 21 September 2015 (UTC)
Also, see https://en.wikipedia.org/wiki/Time_attack#Video_games sirKitKat (talk) 14:11, 21 September 2015 (UTC)

So in the title text, is he being replaced with the ghost who always *ahem* comes last? --SaturNine (talk) 12:53, 21 September 2015 (UTC)

I agree. 173.245.50.154 13:36, 21 September 2015 (UTC)
Women prefer men that are stuck in traffic?? 162.158.90.235 19:17, 21 September 2015 (UTC)
Nah - just someone who takes the "scenic" route. 108.162.215.17 19:50, 21 September 2015 (UTC)
I love that this could be a reference to the move Ghost. Great. -Jeff (talk) 19:51, 21 September 2015 (UTC)

Is this the first time Cueballs children were shown? ẞ qwertz (talk) 17:22, 21 September 2015 (UTC)

I don't know if it's worth mentioning that this appears to be a width-first (route-)search algorithm. A memory-heavy but guaranteed 'perfect' solver of best routing, at every point of choice (from the very first, how you start the journey), all possible/practical travel options are explored (including taking a journey in the 'wrong' direction, or waiting for the non-stop train that is not the first to arrive, to take advantage of connections with faster transport links), in parallel according to the total time (or other measure of efficiency) yet taken on each iteration. Unless any 'ghost' arrives at a node that has already been visited by a 'ghost', when it need not continue. Eventually, the most efficient son-of-a-son-of-a-son...-of-a-son-of-a-ghost will reach the destination, indicating the 'correct' answer. At least within the limits of the split-and-propogate algorithm, and the amount of parallelisation available to devote to the problem. (See also the multiple-overlayed 'searches' performed by two-minutes-of-Nicholas Cage, in the near-climactic scene in the film 'Next' (beware spoilers!).) 141.101.99.12 22:38, 21 September 2015 (UTC)