Why are some games np-complete?
-
04-11-2019 - |
题
I read the Wikipedia entry about "List of NP-complete problems" and found that games like super mario, pokemon, tetris or candy crush saga are np-complete. How can I imagine np-completeness of a game? Answers don't need to be too precise. I just want to get an overview what it means that games can be np-complete.
没有正确的解决方案
不隶属于 cs.stackexchange