Numberlink/Flow Game: How to spot NP-Complete problems?
可以将文章内容翻译成中文,广告屏蔽插件可能会导致该功能失效(如失效,请关闭广告屏蔽插件后再试): 由 翻译 强力驱动 问题: I was trying to find a way to solve the problem in the famous game Flow. http://moh97.us/flow/ After googling I find out that this is a NP-complete problem. A good solution would make use of heuristics and cuts. How can I spot a NP-complete problem easily? Sometimes when I block, I can't see the obvious solution. When this happens with an NP-complete, it's better to recognise it quickly and move on to the next problem. 回答1: When you have an explosion of objects (say objects whose count grows exponentially based on some parameter or