Candy Crush is NP-hard
Computational Complexity
2014-03-11 v1
Authors:
Toby Walsh
Abstract
We prove that playing Candy Crush to achieve a given score in a fixed number of swaps is NP-hard.
Cite
@article{arxiv.1403.1911,
title = {Candy Crush is NP-hard},
author = {Toby Walsh},
journal= {arXiv preprint arXiv:1403.1911},
year = {2014}
}
Related papers
View all related →
Computational Complexity · Computer Science
Bejeweled, Candy Crush and other Match-Three Games are (NP-)Hard
Luciano Gualà, Stefano Leucci, Emanuele Natale
2014-03-25
Computational Complexity · Computer Science
The "Game about Squares" is NP-hard
Jens Maßberg
2014-08-21
Computational Complexity · Computer Science
Losing at Checkers is Hard
Jeffrey Bosboom, Spencer Congero, Erik D. Demaine, Martin L. Demaine +1
2018-06-15
Computational Geometry · Computer Science
Link Crossing Number is NP-hard
Arnaud de Mesmay, Marcus Schaefer, Eric Sedgwick
2019-08-13
Computational Complexity · Computer Science
Trainyard is NP-Hard
Matteo Almanza, Stefano Leucci, Alessandro Panconesi
2016-03-04
Formal Languages and Automata Theory · Computer Science
Reachability Switching Games
John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani
2023-06-22
Computational Complexity · Computer Science
Hexasort -- The Complexity of Stacking Colors on Graphs
Linus Klocker, Simon D. Fink
2026-03-03
Computational Complexity · Computer Science
A handle is enough for a hard game of Pull
Oscar Temprano
2018-01-01
Computational Geometry · Computer Science
PushPush is NP-hard in 2D
Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke
2007-05-23
Combinatorics · Mathematics
Counting Candy Crush Configurations
Adam Hamilton, Giang T. Nguyen, Matthew Roughan
2019-08-28
Computational Complexity · Computer Science
Wordle is NP-hard
Daniel Lokshtanov, Bernardo Subercaseaux
2022-05-17
Quantum Physics · Physics
Two-player entangled games are NP-hard
Anand Natarajan, Thomas Vidick
2020-11-24
Computational Geometry · Computer Science
PushPush is NP-hard in 3D
Joseph O'Rourke, The Smith Problem Solving Group
2007-05-23
Combinatorics · Mathematics
$\mathcal{P}$ Play in Candy Nim
Nitya Mani, Rajiv Nelakanti, Simon Rubinstein-Salzedo, Alex Tholen
2018-05-21
Computational Complexity · Computer Science
Computational Complexity of Arranging Music
William S. Moses, Erik D. Demaine
2016-07-15
Data Structures and Algorithms · Computer Science
Computational Complexity of Swish
Takashi Horiyama, Takehiro Ito, Jun Kawahara, Shin-ichi Minato +3
2026-01-15
Quantum Physics · Physics
Entangled games are hard to approximate
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner +1
2007-11-21
Networking and Internet Architecture · Computer Science
Maximizing the Cohesion is NP-hard
Adrien Friggeri, Eric Fleury
2011-10-11
Combinatorics · Mathematics
Pirates and Treasure
Fraser Stewart
2012-09-25
Combinatorics · Mathematics
King Chasing Problem in Chinese Chess is NP-hard
Chao Li, Zhujun Zhang, Chao Yang
2026-04-03
Combinatorics · Mathematics
Candy-passing Games on General Graphs, II
Paul M. Kominers, Scott D. Kominers
2008-07-30
Data Structures and Algorithms · Computer Science
Sorting by Strip Swaps is NP-Hard
Swapnoneel Roy, Asai Asaithambi, Debajyoti Mukhopadhyay
2025-11-04
Data Structures and Algorithms · Computer Science
Parameterized Analysis of Bribery in Challenge the Champ Tournaments
Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2024-03-27
Computational Complexity · Computer Science
Unshuffling a Square is NP-Hard
Sam Buss, Michael Soltys
2012-12-03
Computational Complexity · Computer Science
2-CLUB is NP-hard for distance to 2-club cluster graphs
Mithilesh Kumar
2019-03-14