Candy Crush is NP-hard
arXiv:1403.1911
Abstract
We prove that playing Candy Crush to achieve a given score in a fixed number of swaps is NP-hard.
Cited by in corpus (8)
- The Computational Complexity of Angry Birds
- The Computational Complexity of Portal and Other 3D Video Games
- Testing match-3 video games with Deep Reinforcement Learning
- Hanabi is NP-hard, Even for Cheaters who Look at Their Cards
- On A Generalization of "Eight Blocks to Madness"
- The Computational Complexity of Fire Emblem Series and similar Tactical Role-Playing Games
- NP-completeness of the game Kingdomino
- TrackMania is NP-complete