THE VIDEO SHELF · computational complexity of games
SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete
Tom Murphy's satirical SIGBOVIK 2007 presentation, delivered under a pseudonym, proving that generalized Super Mario Bros. is NP-complete. It is a short, deadpan take on a complexity theory result.
Why HN readers recommended it
HN likes it as a funny, entertaining presentation, frequently linked in threads on NP-hardness of games and NES automation.
This is a summary from the source dataset, not an endorsement by Hacker News or the video creator.
Video & recommendation details
- Creator / channel
- suckerpinch
- Topic
- computational complexity of games
- Format
- comedy
- Level
- intermediate
- HN recommenders in dataset
- 3
- HN mentions in dataset
- 4
- Recommendation years in dataset
- 2013–2021
These counts and years describe the included Hacker News records; they are not YouTube views or the video’s publication date.
From the original HN conversations
Excerpts from the recorded comments. Follow each source for the full comment and surrounding discussion.
This guy is a genius and also freakin hilarious, I knew I recognised his voice from somewhere; watch this: [VIDEO]
hotwire on Hacker News · 2018-06
In A general technique for automating NES games (2013)Any time I see papers like this, I'm reminded of Vargomax V. Vargomax's classic SIGBOVIK 2007 paper [1]. The presentation is also entertaining [2]. [1] [LINK] [2] [VIDEO]
groovy2shoes on Hacker News · 2013-05
In Classic Nintendo Games are NP-HardIf we're sharing awesome Mario-related work by Tom Murphy, I have to include a link to his video "Generalized Super Mario Bros. is NP-Complete": [VIDEO]
dane-pgp on Hacker News · 2021-11
In Writing a Fuzzer for NES Games
Summaries, classifications and recommendation records are from the HackerTube source dataset. Read about this library and its limitations.