Skip to main content
Puzzling

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

6
  • 2
    $\begingroup$ The best reasoning for this specific problem. +1 $\endgroup$
    – justhalf
    Commented Apr 30, 2023 at 16:31
  • 1
    $\begingroup$ Signed up just to commend your solution (both parts of it!). Very elegant. Love it! $\endgroup$
    – TCN
    Commented May 1, 2023 at 9:57
  • $\begingroup$ 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. $\endgroup$
    – Paul Sinclair
    Commented May 1, 2023 at 14:52
  • 1
    $\begingroup$ @PaulSinclair There are multiple shortest paths. $\endgroup$
    – RobPratt
    Commented May 1, 2023 at 18:55
  • 1
    $\begingroup$ @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. $\endgroup$
    – Paul Sinclair
    Commented May 1, 2023 at 19:02