Timeline for I Hate Traffic And So Do You
Current License: CC BY-SA 4.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 1, 2023 at 19:12 | comment | added | Vilx- | @PaulSinclair Well, yes, this is far from a watertight mathematical proof, and there are indeed at least 4 (obvious) paths that can be taken with the same length. | |
May 1, 2023 at 19:02 | comment | added | Paul Sinclair | @RobPratt - True. There are four, depending on which way one travels around two traffic-free blocks. I should have been more careful in my wording. I was caught up in noting that no solutions involved going through traffic. Such a solution would be possible, provided only one block of traffic was encountered. | |
May 1, 2023 at 18:55 | comment | added | RobPratt | @PaulSinclair There are multiple shortest paths. | |
May 1, 2023 at 14:52 | comment | added | Paul Sinclair | Technically, all you've shown is that the path is a fastest-time solution. But it is easy to check that any path that doesn't backtrack (travel in one direction, then later travel in the opposite direction) must pass through at least two blocks with traffic, which is enough to show uniqueness. | |
May 1, 2023 at 9:57 | comment | added | TCN | Signed up just to commend your solution (both parts of it!). Very elegant. Love it! | |
Apr 30, 2023 at 16:54 | history | edited | Vilx- | CC BY-SA 4.0 |
added 854 characters in body
|
Apr 30, 2023 at 16:31 | comment | added | justhalf | The best reasoning for this specific problem. +1 | |
Apr 30, 2023 at 12:39 | history | edited | RobPratt | CC BY-SA 4.0 |
added 1 character in body
|
Apr 30, 2023 at 10:46 | history | answered | Vilx- | CC BY-SA 4.0 |