Explore BrainMass

Explore BrainMass

    Euler Path Problem: Cross Bridges No More Than Once

    Not what you're looking for? Search our solutions OR ask your own Custom question.

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    Please see the attached file for the fully formatted problem.

    Traveler's Dilemma
    One day, travelers in a faraway land came upon a river with an island in the middle. On the other side of the island, the river continued but it formed two branches. The travalers also saw seven bridges that crossed the river in seven different places. Upon attempting to cross one of the bridges, an old gatekeeper appeared in front of the travelers and gave them this warning:

    "If you cross any bridge, you must cross all seven bridges but you may not cross a bridge more than once."

    © BrainMass Inc. brainmass.com December 24, 2021, 5:10 pm ad1c9bdddf


    Solution Preview

    Please see the attached file.

    The travelers disappeared into the thin air.
    Let's transform this map into a graph:

    In the graph, the vertex1 represents the island, which is connected to the lands by 5 bridges, vertices 2, 3 and 4 represent the lands. This graph has 7 edges, ...

    Solution Summary

    A puzzle is solved using simple geometry and logic. The solution is detailed and well presented.