Bridge Constructor Puzzle

The Seven Bridges of Königsberg is a historically notable problem in mathematics. Its negative resolution by Leonhard Euler in 1735 laid the foundations of graph theory and prefigured the idea of topology.

The city of Königsberg in Prussia (now Kaliningrad, Russia) was set on both sides of the Pregel River, and included two large islands which were connected to each other and the mainland by seven bridges.

The problem was to find a walk through the city that would cross each bridge once and only once. The islands could not be reached by any route other than the bridges, and every bridge must have been crossed completely every time; one could not walk halfway onto the bridge and then turn around and later cross the other half from the other side. The walk need not start and end at the same spot. Euler proved that the problem has no solution. There could be no non-retracing the bridges. The difficulty was the development of a technique of analysis and of subsequent tests that established this assertion with mathematical rigor.

The people living in Königsberg had a game where they would try to walk across each bridge once and only once. You can chose where to start. Then click on a bridge to cross it. See if you can manage it!