Eulerian Paths
🔓 This is an unlocked sample!
Byrdseed.TV is open for new memberships through October 17th, 2020. Join today!
Have students tackle the classic “[Seven Bridges of Konigsberg](https://en.wikipedia.org/wiki/Seven_Bridges_of_K%C3%B6nigsberg)” problem: Can you cross each bridge exactly once? But *please* don’t reveal the name until the end or they can just look it up. For further avenues of exploration, let students dig into: * [Hamiltonian Paths](https://en.wikipedia.org/wiki/Hamiltonian_path) * The [Icosian Game](https://en.wikipedia.org/wiki/Icosian_game) * And [Euler](https://en.wikipedia.org/wiki/Leonhard_Euler) himself Download [the…
How can you cross each bridge in this city exactly once?
