CoinMoving Puzzles
Abstract
We introduce a new family of oneplayer 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 equilateraltriangle grid. These existence results are supplemented by polynomialtime algorithms for finding a solution.
 Publication:

arXiv eprints
 Pub Date:
 March 2002
 arXiv:
 arXiv:cs/0204002
 Bibcode:
 2002cs........4002D
 Keywords:

 Computer Science  Discrete Mathematics;
 Computer Science  Computational Geometry;
 Computer Science  Computer Science and Game Theory;
 G.2.1;
 G.2.2;
 F.2.2;
 I.3.5
 EPrint:
 25 pages, 33 figures. To appear in the book More Games of No Chance edited by Richard Nowakowski and published by MSRI