硬币移动拼图
Coin-Moving Puzzles
摘要：
我们介绍了一个新的家庭的一个球员的游戏，涉及到移动硬币从一个配置到另一个。移动受到限制，因此硬币只能放置在与至少两个其他硬币相邻的位置。本文的目标是确切地指定这些游戏是可解的。通过引入额外硬币数为常数的概念，我们给出了正方形网格和等边三角形网格上可解问题的紧性定理。这些存在的结果补充多项式时间算法找到一个解决方案。
英文摘要：
We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of this paper is to specify exactly which of these games are solvable. By introducing the notion of a constant number of extra coins, we give tight theorems characterizing solvable puzzles on the square grid and equilateral-triangle grid. These existence results are supplemented by polynomial-time algorithms for finding a solution.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
