0
$\begingroup$

This question already has an answer here:

How i can walk on these 7 bridges without walk on one of them twice?

enter image description here

After some research i found that "Koengsberg bridge" is not an Euler circuit.

$\endgroup$

marked as duplicate by boboquack, Gareth McCaughan Oct 20 '17 at 0:40

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

  • 1
    $\begingroup$ It's not possible... $\endgroup$ – somebody Oct 20 '17 at 0:01
  • $\begingroup$ @Ibrahim, if it isn't immediately obvious that the question we've marked this as a duplicate of is basically the same as this one, follow the "Seven Bridges of Koenigsberg" link in either the first comment under the question or GoodDeed's answer. $\endgroup$ – Gareth McCaughan Oct 20 '17 at 0:41
  • 1
    $\begingroup$ Since the question was "How i can walk on these 7 bridges without walk on one of them twice?", one of the solution is if you can swim(walk B-A-B-D-B-C-D, swim to A, walk A-C). Since you only said walk(not cross), you can walk B-A-B-D-B-C, walk halfway the C-A bridge, turn back in the middle, go back to C, walk C-D. $\endgroup$ – Nopalaa Oct 20 '17 at 8:03
2
$\begingroup$

I say it's impossible to walk on these 7 bridges without walk on one of them twice.

As the picture shows, each island has either 3 or 5 bridges connected to it, that's why I declare it impossible to walk on these 7 bridges without walk on one of them twice.

There's a proper proof out there that shows that: To walk on bridges only once each, EACH island must have an EVEN number of bridges connected to it. Or exactly 2 have an odd number of bridges connected.

Here, we have 4 islands having an odd number of bridges connected. So it's impossible to walk on these 7 bridges without walk on one of them twice.

$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.