4 ms·

Soviet solution: bomb two of the bridges, therefore allowing an Eulerian path.

• gherkinnn 6y ago
  You mean an Alexandrian solution (to a Gordian knot?)
  • lisper 6y ago
    I think the GP was intended to be funny. (And, judging by the downvotes, HN still has zero tolerance for humor.)
    • pfarrell 6y ago
      Well, the HN/engineer solution would be to propose the building of a new bridge. Then we could have a big discussion about funding strategies, metallurgical esoterica, cutting edge topological algorithms for determining best place to add a vertex in the graph, and/or history of Roman land jurisdiction. And we’d all learn something.
      • rsecora 6y ago
        And maintain the old one for backward compatibility.
      • usrusr 6y ago
        The problem states seven bridges, not seven or more. Clearly, the engineering would be a tunnel. (the beaver solution would be a dam. "List of mathematical problems solvable by beavers")
• scaredginger 6y ago
  Wouldn't you only need to bomb one bridge? Bombing one bridge reduces the degree of two vertices.