TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Classic Nintendo Games Are NP-Hard (2012)

115 pointsby iamandoniover 9 years ago

11 comments

CJeffersonover 9 years ago
I wondered how this could possibly work, then found this sentence. Basically their generalisations have to go far beyond what these games are (the NES mario games had everything be forgotten when you scrolled along).<p>&gt; For example, recall that in Super Mario Bros. everything substantially off screen resets to its initial state. Thus, if we generalize the stage size in Super Mario Bros. but keep the screen size constant, then reachability of the goal can be decided in polynomial time:
评论 #10576378 未加载
评论 #10575519 未加载
headcanonover 9 years ago
Interesting - I wonder if NP-hardness can be used as a sufficient indicator of how &quot;enjoyably challenging&quot; a game is. There&#x27;s a reason these games are such classics, and I dont think its entirely because of their timing, polish, and marketing. Miyamoto&#x27;s games always had that special &quot;something&quot; (opinion, I know), maybe this has something to do with it?
评论 #10575522 未加载
评论 #10575357 未加载
评论 #10575317 未加载
评论 #10575285 未加载
评论 #10575237 未加载
评论 #10575359 未加载
fiatjafover 9 years ago
Can someone explain what is NP-Hard in a few sentences?
评论 #10575860 未加载
评论 #10575783 未加载
评论 #10575721 未加载
评论 #10576188 未加载
tekknolagiover 9 years ago
This is my algorithms professor :D Dope!
echelonover 9 years ago
This seems strange to me. Mario doesn&#x27;t &quot;feel&quot; NP-hard. I guess I&#x27;ll have to read the paper tonight.
评论 #10575298 未加载
评论 #10575260 未加载
Karunamonover 9 years ago
So as someone with only a lay understanding of what NP-Hard means - does anyone remember that neural network that someone trained to play the game[1]?<p>So if you can train a neural network to solve an NP-Hard problem, does that mean by definition (since NP refers to a whole class of problems) that a neural network could eventually be trained to solve any given NPH problem given the time and compute resources to do so?<p>[1]: <a href="https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=xOCurBYI_gY" rel="nofollow">https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=xOCurBYI_gY</a>
评论 #10575513 未加载
评论 #10575455 未加载
评论 #10575442 未加载
评论 #10576040 未加载
newsignupover 9 years ago
Why is this even a surprise, people have been participating in AI challenges for long time (like these : <a href="http:&#x2F;&#x2F;ants.aichallenge.org&#x2F;" rel="nofollow">http:&#x2F;&#x2F;ants.aichallenge.org&#x2F;</a> ) and are well aware that those are hard problems, they develop heuristics since its not computationally possible to obtain perfect solution.
评论 #10575700 未加载
BorisMelnikover 9 years ago
big NES fan here, not a low level programmer - can someone ELI5?
mtgxover 9 years ago
Let&#x27;s make quantum computers play Nintendo games then.
评论 #10575648 未加载
alttabover 9 years ago
I figured that out when I was 3.
评论 #10575328 未加载
xigencyover 9 years ago
What is that even supposed to mean? The abstract doesn&#x27;t clarify what &quot;NP-hardness&quot; means in terms of video games.<p>This looks really click-baity.<p>In terms of writing a Nintendo game, the solution is a fixed constant: the game&#x27;s binary.<p>In terms of solving a Nintendo game, (playing to completion), the solution is in constant time: the amount of time it takes to play the game.<p>Edit: Great, downvotes.
评论 #10575622 未加载
评论 #10576401 未加载
评论 #10576324 未加载