Editing Talk:1580: Travel Ghost
Please sign your posts with ~~~~ |
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 18: | Line 18: | ||
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) | 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) | ||
− | |||
− | |||
− | |||
− | |||
− | |||
Will his children have half-siblings that are fathered by the ghost that has replaced him in the bedroom? Or are ghosts infertile?[[Special:Contributions/108.162.215.170|108.162.215.170]] 04:07, 22 September 2015 (UTC) | Will his children have half-siblings that are fathered by the ghost that has replaced him in the bedroom? Or are ghosts infertile?[[Special:Contributions/108.162.215.170|108.162.215.170]] 04:07, 22 September 2015 (UTC) | ||
Line 28: | Line 23: | ||
[[Special:Contributions/162.158.90.249|162.158.90.249]] 11:57, 22 September 2015 (UTC) | [[Special:Contributions/162.158.90.249|162.158.90.249]] 11:57, 22 September 2015 (UTC) | ||
:Not really - or at least not real. There may be some "potential photons" in some attempts to describe some quantum-based theory ... but there will certainly be no investigation photons after wave collapse. -- [[User:Hkmaly|Hkmaly]] ([[User talk:Hkmaly|talk]]) 12:12, 22 September 2015 (UTC) | :Not really - or at least not real. There may be some "potential photons" in some attempts to describe some quantum-based theory ... but there will certainly be no investigation photons after wave collapse. -- [[User:Hkmaly|Hkmaly]] ([[User talk:Hkmaly|talk]]) 12:12, 22 September 2015 (UTC) | ||
− | |||
− | |||
If the simulations explore all travel possibilities, how long will it be until bike ghost gets run off the road by bus ghost? Or flattened by texting driver ghost? [[Special:Contributions/198.41.238.33|198.41.238.33]] 12:30, 22 September 2015 (UTC) | If the simulations explore all travel possibilities, how long will it be until bike ghost gets run off the road by bus ghost? Or flattened by texting driver ghost? [[Special:Contributions/198.41.238.33|198.41.238.33]] 12:30, 22 September 2015 (UTC) | ||
− | |||
There's actually a very similar mechanism in the game Canvas Rider, where the best times on a track (it's a bike racing game with stick figures) can be clicked and a ghost that takes the same path with the same speed as those people appears and moves while you do. In fact, they actually look somewhat similar to the ghost in panel 4. [[Special:Contributions/108.162.226.149|108.162.226.149]] 13:17, 22 September 2015 (UTC) | There's actually a very similar mechanism in the game Canvas Rider, where the best times on a track (it's a bike racing game with stick figures) can be clicked and a ghost that takes the same path with the same speed as those people appears and moves while you do. In fact, they actually look somewhat similar to the ghost in panel 4. [[Special:Contributions/108.162.226.149|108.162.226.149]] 13:17, 22 September 2015 (UTC) | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− |