The Puzzle Game Infinite Energy

An interactive companion: play the game, and watch the complexity reductions in action. Draw wires by dragging from one part to another.

How the game works

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.

What exactly is a loop? Because a board shares energy across all its sockets, you can send energy out of one socket along a wire and have the board hand it back through another socket — a closed cycle. The smallest loop is therefore a single wire joining two sockets of the same board. Once a loop has been charged while a source is attached, it stays lit forever after you unplug. (In graph terms: the wires, plus each board’s implicit all-to-all internal links, form a directed graph; any directed cycle that has been energized is self-sustaining.)
Controls. Drag from one part to another to lay a wire (legal targets light up as you drag). Click a wire to remove it.

Connectability constraints

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.

A 3-step, hands-on walkthrough of the core idea — start here.


energized dark source

Moves: 0

Hamiltonian Path → Infinite Energy

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.

Live construction: click empty space in the graph editor to add a vertex; click one vertex then another to add/remove an edge. The puzzle level on the right rebuilds instantly (each vertex → a 2-socket board; one 3-socket anchor seeds the loop). Wires you lay in the puzzle light up the graph edge they realize.

Graph editor

Puzzle level

Status

Grid Graph → Geometric Infinite Energy in R²

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.

Live construction: click lattice cells to toggle vertices. Adjacent vertices are automatically joined. The blue cell (top-left) is where the anchor attaches — the path must start there. The puzzle level on the right rebuilds instantly as you paint. Faint gray links in the puzzle show every pair within wire range; wires you lay light up the matching grid edge on the left.

Grid editor

Puzzle level

Status

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.

Majority → Unconstrained Infinite Energy

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.

The construction

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.