Fetching the paper…
Reading the bibliography…
We prove that playing Candy Crush to achieve a given score in a fixed number of swaps is NP-hard.
Where the really hard problems are
P. Cheeseman, B. Kanefsky, and W.M. Taylor · 1991
Earlier work this paper cites.
Easy problems are sometimes hard
I.P. Gent and T. Walsh · 1994
Earlier work this paper cites.
Phase transitions and annealed theories: Number partitioning as a case study
I.P. Gent and T. Walsh · 1996
Earlier work this paper cites.
The TSP phase transition
I.P. Gent and T. Walsh · 1996
Earlier work this paper cites.
Minesweeper is NP-complete
Richard Kaye · 2000
Cited alongside, same era.
Tetris is hard, even to approximate
Erik D. Demaine, Susan Hohenberger, and David Liben-Nowell · 2003
Cited alongside, same era.
It is tough to be a plumber
Daniel Kral, Vladan Majerech, Jiri Sgall, Tomas Tichy, and Gerhard Woeginger · 2004
Cited alongside, same era.
Randomness and structure
G. Gomes and T. Walsh · 2006
Cited alongside, same era.
Tetravex is NP-complete
Y. Takenaga and T. Walsh · 2006
Later among the works it cites.
A survey of NP-complete puzzles
Graham Kendall, Andrew J. Parkes, and Kristian Spoerer · 2008
Later among the works it cites.
Where are the hard manipulation problems?
T. Walsh · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…