An interactive companion: play the game, and watch the complexity reductions in action. Draw wires by dragging from one part to another.
Goal: light up every board while no power source is plugged in. The catch is that energy must keep flowing entirely on its own.
The layout has three kinds of part: boards (rectangles holding sockets, the small circles), power sources (the black diamonds), and the wires you draw between them.
Physically, wires have a maximum length: a socket can only reach parts that lie within that length, so not every pair of sockets (or a source and a socket) can be joined. In most of this game we relax that geometric picture and simply declare, level by level, an arbitrary set of connectable pairs — no notion of positions or distances required.
Formally, every level comes with a connectability constraint matrix M: a symmetric 0/1 matrix indexed by every socket and every power source, where M[u,v] = 1 exactly when a wire between u and v is legal. tryConnect and every legal-target highlight in this page consult M before allowing a wire. The one exception is the Grid Graph tab, where M is not chosen arbitrarily — it is generated purely from Euclidean distance, so it reproduces the maximum-wire-length rule directly instead of relaxing it.
Moves: 0
The hardness reduction. Draw any graph. We turn it into a game instance whose boards can all be energized (source-free) exactly when your graph has a Hamiltonian path. Solving the puzzle is finding the path.
Graph editor
Puzzle level
Here connectability is not arbitrary — it comes from real positions in the plane: two sockets can be wired iff they sit within a fixed distance d of each other (a wire length). Paint cells on the lattice to build a grid graph; each cell becomes a board whose two sockets are placed at its location, so the distance rule reproduces grid adjacency. The puzzle is solvable iff the grid graph has a Hamiltonian path from the marked start cell.
Grid editor
Puzzle level
Every faint link is a pair of sockets within distance d. They trace your grid exactly — that is what "geometrically realizable" means. Here M is derived from distance, not chosen by hand.
The unconstrained game (any socket may join any other) is easy — winnable iff |P| ≥ 2|B| and some board has ≥3 sockets. That simple test is already as hard as counting bits. Type a bit-string: each bit becomes a board, and the instance is winnable exactly when the string has a majority of ones.
Bit 1 → a 3-socket board. Bit 0 → a 1-socket board. One shared source.
A 3-socket board can host the starting loop; a 1-socket board is pure cost. Balancing the two reproduces the threshold s ≥ m/2.
Colorless game only. A loop, once charged while a source was attached, stays charged as long as its wires remain.