The daily board is seven tiles wide and seven tall. It looks small. Then you count how many ways it can be turned, and the number stops looking small at all.
Every tile in Conduit has four possible orientations, turned zero, one, two or three quarter-steps from where it sits.1 Give each of the forty-nine cells on the daily grid an independent choice among those four, and the number of distinct board states is 449. Written out, that is 316,912,650,057,057,350,374,175,801,344, over three hundred octillion configurations, of which the game asks you to find one that is fully lit and leak-free.
The scramble that hands you a puzzle chooses, for each tile, a random number of quarter-turns from zero to three.1 So the board you meet is drawn uniformly from that enormous space, minus one careful exclusion the game makes to avoid dealing you a grid that is already solved.1 Brute force is off the table: the game's own tests note that trying all four rotations of every tile is exponential, and they only ever run the exhaustive search on toy boards of nine cells or fewer.2
That headline number over-counts, because some tiles do not care how you turn them. A cross, connectors on all four sides, looks identical in all four orientations; rotating it changes nothing. A straight line has only two distinct looks, horizontal and vertical, because a half-turn maps it onto itself. Only the asymmetric shapes, the elbow, the tee, and the single-connector end, genuinely have all four distinct orientations.3
| Shape | Connectors | Distinct turns | Symmetry |
|---|---|---|---|
| End (node/bulb) | 1 | 4 | none |
| Line | 2 | 2 | half-turn |
| Elbow | 2 | 4 | none |
| Tee | 3 | 4 | none |
| Cross | 4 | 1 | full |
Shapes are named in the game's design notes; the distinct-orientation counts follow from the four-bit connector mask being unchanged under the rotations listed.3 The effective search space is smaller than 449 by exactly the product of these per-tile symmetries, but on any board with a healthy mix of elbows and tees, still astronomically large.
Turn the question around. Forget the orientations you might try; ask how many solved boards are possible in the first place. A finished Conduit grid is a set of pipe that is connected, power reaches every tile, and has no wasted loop, because a spanning tree is what the generator builds: connected, acyclic, one path from the source to each node.3 Each such wiring is, precisely, a spanning tree of the grid graph, where the vertices are cells and the edges are the shared borders a pipe can bridge.
And spanning trees can be counted exactly. Kirchhoff's matrix-tree theorem, a result from 1847, says the number of spanning trees of any graph equals any cofactor of its Laplacian matrix, a determinant you can compute in polynomial time.4 For grids the count explodes with size: a humble 4×4 lattice already has 100,352 spanning trees, and the number climbs ferociously from there. Every one of those is a legitimate, fully-lit Conduit solution. The puzzle is hard not because answers are scarce, but because they are hidden in a far larger crowd of near-answers.
The solved states are countable and many; the scrambled states are countable and vastly more. Solving is the search for a needle that you know exists, because the game hid it there on purpose.
You might hope the puzzle decomposes: fix the top-left, then the tile beside it, and march tidily to the far corner. Sometimes a stretch of the board does yield to that. A tile in a corner has only two edges that touch neighbours, so its connectors are heavily constrained; an end tile on the boundary can only point inward. These forced moves give footholds.
But the two win conditions do not chain so obligingly. Leak-free is a local property, you can verify it edge by edge. Powered is not: whether a tile is lit depends on an unbroken chain of joins running all the way back to the source, possibly across the entire board.3 A change you make in one corner can plunge a distant region into darkness by breaking the single path that fed it. That coupling, every tile's fate potentially tied to a route through the whole grid, is what keeps a rotation puzzle from collapsing into easy bookkeeping, and it is why solvers for the broader Net/Pipes family lean on constraint propagation and search rather than a simple left-to-right sweep.5
For all the vastness of the state space, the quantity Conduit grades you on is tiny and human: how many times you tapped. The score is 1000 − 4 × moves − 2 × seconds, floored at zero.3 There is a theoretical minimum number of rotations for any given board, the sum, over all tiles, of the fewest quarter-turns needed to reach a solved orientation, and every wasted spin past it costs you four points, every idle second two.
So the real game sits between two enormous facts and one small one. The haystack is 449 orientations wide; the needles are the grid's many spanning trees; and your job is to travel from one to the other in as few of the only-legal-move as you can manage. The combinatorics guarantee an answer is in there. The scoring quietly dares you to find it without wandering.4