I came across a funny example of problem formation yesterday (cc @Meaningness).
@thilogross, a researcher in Bristol (where I live), showed that Bristol's version of the Königsberg bridge problem (https://en.wikipedia.org/wiki/Seven_Bridges_of_K%C3%B6nigsberg …) *is* soluble, and walked the resulting 33 mile circuit...
-
-
Finally you have to decide how big the bridges have to be to count. The two bottom bridges off the islet count in this image. The top ones are little lock gates and are excluded.pic.twitter.com/1dgATEzXeW
Show this thread -
Anyway after spending way too much time on this I think I actually have to walk it some time. Though a new bridge is being built, so the route might completely change by the time I get to it!
Show this thread
End of conversation
New conversation -
-
-
I have a weird memory of trying to decide whether to count this as one bridge or two, but I can’t imagine why I would have wondered that, so I’m probably making it up and have constructed a false memory retrospectively
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.