跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-21 12:19 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 03:42 — 2026-11-22 03:42(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-21 12:19最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
新论文 · v1arXiv:2611.24918

《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.