Euler’s lines
Imagine you are standing in front of a map that shows a network of paths and nodes. If you manage to run a route starting from your starting point in such a way that you run through each connection between two nodes exactly once.
This problem goes back to the Swiss mathematician Leonhard Euler (1707–1783), who asked himself exactly this question. At the exhibit, you can try your hand at several path networks. What is the law behind this?