This is a fun CMU affiliated project that attempts to “discover how many of Pittsburgh’s 446 bridges can be traversed without crossing the same bridge twice.”
From the organizers:
In 1736, mathematician Leonard Euler proved it was impossible to walk through the German city of Königsberg crossing each of the city’s seven bridges exactly once. His work, famously dubbed the “Bridges of Königsberg” problem, laid the foundation for graph theory and network analysis, and foreshadowed the invention of topology. We intend to create an expanded, more complex version of this famous study using Pittsburgh’s 446 bridges (Regan 2006).