52 citations · 271 across the 48 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2010★ 2 cited
The complexity of UNO
Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey +3
This paper investigates the popular card game UNO from the viewpoint of algorithmic combinatorial game theory. We define simple and concise mathematical models for the game, includ…
cs.DM2002★ 16 cited
Coin-Moving Puzzles
Erik D. Demaine, Martin L. Demaine, Helena A. Verrill
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 positi…