In 1735 the citizens of Konigsberg, after years of trial and error, asked Leonhard Euler (pronounced "oiler"), the eminent young mathematician, to solve the following puzzle: Is it possible to tour the city's eight bridges in such a way that every bridge is crossed, but none more than once? And what would be the shortest route?

Hint: It is possible. Start with OP.