Nine pipes, no crossings. It cannot be done — and here is the proof.
Drag from a house to a utility to lay a pipe. Goal: 9 pipes, 0 crossings.
Step 1 of 8
All 9 pipes fit with 0 crossings — three of them dive through the hole. Drag to orbit; pinch or scroll to zoom.
View
When it is flat, a pipe that runs off one edge comes back in on the opposite edge — that wrap-around is the hole.
Where’s the maths? This is graph theory — and, hiding just behind it, topology, the mathematics of what stays true when you bend and stretch a shape. Six dots and nine lines is all this puzzle is: three houses, three utilities, one pipe for every house–utility pair. Nothing about the answer depends on where you put the houses or how curvy you make the pipes, so the real question is not a drawing question at all — it is a question about the surface you are drawing on. A picture drawn on a flat sheet with no lines crossing is called a planar drawing, and it obeys a hard counting law discovered by Euler in 1750. That law says a flat drawing with 6 dots and 9 lines must cut the sheet into exactly 5 pieces — and then a second count shows 5 pieces is one piece too many to be possible. So the puzzle is not hard; it is impossible, and you can prove it with nothing but counting.
Beyond the syllabus: planar graphs and the torus are enrichment.
Call the dots V, the pipes E and the regions the drawing cuts the sheet into F (counting the endless region outside everything as one face). Euler’s formula for any connected drawing with no crossings is V − E + F = 2.
Controls: drag from a house to a utility to lay a pipe · arrow keys pick a pair, Enter lays it, Backspace removes it · on the doughnut, drag to orbit and scroll or pinch to zoom.