Computer Science – Discrete Mathematics
Scientific paper
2002-03-31
Computer Science
Discrete Mathematics
25 pages, 33 figures. To appear in the book More Games of No Chance edited by Richard Nowakowski and published by MSRI
Scientific paper
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.
Demaine Erik D.
Demaine Martin L.
Verrill Helena A.
No associations
LandOfFree
Coin-Moving Puzzles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Coin-Moving Puzzles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coin-Moving Puzzles will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-412923