《Infinite Energy》谜题的难度
Hardness of "Infinite Energy" Puzzles
Utkarsh Tiwari, Utkarsh Thanvi, Armaan Sethi, Aalok Thakkar, Neeldhara Misra
AI 速读 基于摘要
论文研究单机解谜游戏 Infinite Energy 及其多个变体的判定复杂度,证明多数变体为 NP-hard,部分变体可精确刻画到 TC^0 完全或 PSPACE 上界。
cs.CC
查看原文摘要
Infinite Energy (by Light Potato, 2025) is a single-player puzzle in which one wires a network of sockets so that, after every power source is unplugged, energy keeps circulating and leaves every board energized. We study several variants of the game and the complexity of deciding whether an instance can be won. The variants can be played at https://infinite-energy-peer-review.netlify.app, which also has worked examples of the reduction techniques. The colorless game, with connectability given by an arbitrary matrix, is NP-hard (by reduction from Hamiltonian Path) and lies in PSPACE. We give a seven-socket instance winnable only by charging a temporary battery loop and then breaking it, so the natural "charge and keep" strategy fails. We reduce NP-membership to one conjecture: that every winnable instance has a winning play in which no socket is charged twice. Two variants bound the complexity more tightly. The unconstrained variant, in which connectability is unrestricted, is $\mathsf{TC}^0$-complete under $\mathsf{AC}^0$ Turing reductions (hence in L). The geometric variant, in which connectability is set by proximity of points in $\mathbb{R}^k$, stays NP-hard for every fixed $k \ge 2$ via reduction from Hamiltonian Path over grid graphs. The one-dimensional case is open. The colored variant is NP-hard, though a matching upper bound remains open.