The Seven Bridges of Königsburg

In 1736, Swiss mathematician Leonhard Euler discovered the solution to a problem that the citizens of Königsburg had argued about for quite some time. He described the problem as follows:

In the town of Königsberg in Prussia there is an island A, called “Kneiphoff”, with the two branches of the river (Pregel) flowing around it. There are seven bridges, a, b, c, d, e, f, and g, crossing the two branches.The question is whether a person can plan a walk in such a way that he will cross each of these bridges once but not more than once. I was told that while some deny the possibility of doing this and others were in doubt, there were none who maintained that it was actually possible. On the basis of the above I formulated the following very general problem for myself: Given any configuration of the river and the branches into which it may divide, as well as any number of bridges, to determine whether or not it is possible to cross each bridge exactly once.

For next week’s class, create a single, black-and-white, 51p x 66p sheet that visualizes the problem and its solution. The purpose of your sheet is to teach others how to solve the Königsburg Bridge Problem, so you must use the tools and conventions of typography to help make the information clearer, and you must use whatever resources you have available to teach yourself more about the problem so that you may thougtfully explain it to an audience by way of your design. You may use one typeface only for your solution. Please note that you only have one week to complete the assignment. Good luck.

This assignment is from the class Letters, Symbols, and Composition.