the problem was to find a way to walk through the city by crossing each bridge once and only once. the islands could not be reached by any route other than the bridges. every bridge must have been crossed completely every time. the walk need not start and end at the same spot. euler proved that the problem has no solution.