|The seven bridges of Konigsberg
In the city of Konigsberg there is a river with two islands.
The two islands are connected each other by a bridge and
to the land with other bridges: one island has two bridges
for each river side and the other island has a bridge for
each river side (this gives us a total of seven bridges).
The problem is finding a path that travels on every bridge
and never walks the same bridge twice. You should either find
such a path or prove that no path can exist.
Click the right arrow to see the solution or the left
arrow to go back to the problem list.