|
|
|
|
|
by Raph_Koster
222 days ago
|
|
1. As the article says, "People will be willing to go along with pretty simple and pretty familiar problems as long as the feedback is great." 2. For arbitrary n x m boards, Candy Crush (and Bejeweled, it's predecessor), has been shown to be NP-complete. That means as a general class of problem, it's officially hard. This is why I said that "A lot of very good problems seem stupidly simple, but have depths to them." If you look at some of the ones I examine in this talk: https://www.raphkoster.com/games/presentations/games-are-mat... you'll see they are often what seems very simple! |
|