Cross the Network
My Best Mathematical and Logic Puzzles
A classic topological puzzle: draw one continuous line across a closed network of segments so that it crosses every segment exactly once. The network here has 16 segments in total.
[Figure: a wide rectangle cut by a horizontal line running its full width, a bit above the middle, into a top and bottom band. The top band is divided into three cells by two vertical segments (one about a third of the way across, one about two-thirds), each running from the top edge down to the horizontal line. The bottom band is divided into two cells by a single vertical segment, roughly midway across, running from the horizontal line to the bottom edge. Counting each stretch between junctions or corners as one segment gives 16: 3 along the top edge, 2 along the bottom edge, 2 on each short side, 4 along the horizontal line, and 3 vertical dividers. A sample curve snakes in and out of the network, crossing 15 of the segments but leaving one uncrossed, so it is not a solution.]
The rules rule out tricks: the line may not pass through a vertex, run along a segment, or rely on folding the paper.
On a flat plane the task is provably impossible. The questions to answer: can it be done if the network is drawn on the surface of a sphere? What about on the surface of a torus (a doughnut shape)?