The puzzle
Tiles carrying pipe segments, each rotatable. Turn them until an unbroken path connects one side to the other. 90 seconds.
Underneath the pipes this is a constraint satisfaction problem: every tile has four ports, adjacent tiles must agree at their shared edge, and you are searching for the assignment of rotations that satisfies every constraint at once.
Why solving it from both ends is faster
The instinct is to start at the entrance and extend forward. That is the slowest method, because a wrong choice early is only discovered many tiles later.
- Work from both ends toward the middle. The entry and exit tiles have only one valid orientation each — they are forced. So are their neighbours, usually. Start where the constraints are tightest.
- Find the forced tiles first. Any tile whose neighbours are already fixed has exactly one legal rotation. Placing all the forced tiles before guessing anything eliminates most of the search.
- Corners and edges are cheap information. A tile against the boundary cannot point outward, which removes rotations for free.
- Straight pieces are the traps. They look flexible but only have two distinct orientations, so they constrain more than curves do — which makes them useful anchors.
This is the same principle that makes Sudoku tractable: propagate the certainties before you speculate. Guessing early and backtracking is the expensive path.
What it actually tests
Spatial reasoning, obviously, but more specifically mental simulation — the ability to see what a tile will look like rotated without rotating it. People who tap each tile through all four positions to check are doing the same work with their hands instead of their heads, and the clock notices.
There is also a real planning component. The connection either exists or it does not, so partial progress earns nothing — which rewards deciding on a route before committing to rotations.
Frequently asked
Q. Is there always a solution?
A. Yes. Boards are generated by laying a valid path first and then scrambling the
rotations, so a solution always exists.
Q. Is the path ever a straight line?
A. No — routes are generated to zigzag between columns, which is what stops the puzzle
from being solved by connecting the obvious middle row.
Q. I can see the route but run out of time.
A. Then the bottleneck is execution, not reasoning. Fix the route in mind first, then
rotate in one pass rather than adjusting as you go.
For mental rotation without the routing, try shape rotation. For planning with no spatial component, the tower puzzle.