arXiv:1403.1911cs.CC
Candy Crush is NP-hard
Abstract
We prove that playing Candy Crush to achieve a given score in a fixed number of swaps is NP-hard.
On Hacker News
Linked by 2 identifiable commenters in 2 comments across 2 threads, from Mar 2014 to May 2016. Found in 2 HN submissions from Mar 2014 to Mar 2014. Open submission discussions.
Discussed in comments2 threads
-
-
Direct link to PDF: http://arxiv.org/pdf/1403.1911v1.pdf
-
Submitted to Hacker News
Also discussed alongside
Connected through shared HN threads, not inferred similarity or a recommendation.
Seems the authors were beaten to the punch? http://arxiv.org/abs/1403.1911
gradstudentView on HNParent context