Routes Problem: Can you find a route that crosses each bridge exactly once?

[bbl]

The problem is attached in the image below:

Any help would be appreciated! Thank you!

 

[blamocur]

A hint: how many times would you visit the middle island?

 

[bbl]

A hint: how many times would you visit the middle island?

If I'm starting at the South Bay, I can visit the middle island four times when crossing the four bridges near South Bay.

Can this be solved using Euler's bridge problem?

 

[Deleted member 4993]

If I'm starting at the South Bay, I can visit the middle island four times when crossing the four bridges near South Bay.

Can this be solved using Euler's bridge problem?

Yes - the principle developed there (graph theory involving edges, nodes, etc. in a planar graph ) can be used here.

 

[Cubist]

If I'm starting at the South Bay, I can visit the middle island four times when crossing the four bridges near South Bay.

There's only one bridge that goes from South Bay directly to the middle island (labelled 2 below)...

       North Bay
#########################
  |        |        |
  |        |        |
#####    #####----#####
##1##----##2##    ##3##
#####    #####----#####
 | |       |        |
 | |       |        |
#########################
       South Bay



Just concentrate on the middle island...

           A
           |
           |
         #####----C
    B----##2##
         #####----D
           |
           |
           E

Initially you plan to use bridge E (from South Bay), and then you'll be left standing on the island. Which bridge will you use next, and will you still be standing on island 2? Continue...