Konisberg was a Prussian town (now in Russia) built around the river Pregel. The river had two large islands in the middle of it and they were connected to each other and the rest of the city by seven old bridges (check the picture).
There is a puzzle connected to the layout of the city. The puzzle goes something like this:
Is it possible to find a route through the city that crosses all bridges only once?
The bridges must be walked fully, with no backtracking after having walked across half of the bridge length to complete the same bridge by later walking from the other side. The walk must start and end at the same spot.
This problem was studied by an eminent 18th century mathematician, Leonhard Euler, who attempted to solve the puzzle mathematically. His efforts spawned a branch of mathematics: Eulerian graph theory. How is your math? Can you solve the puzzle?
Leave a Reply