# mario Published articles for mario. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## How to Play Grand Poo World 3 DevFeed: [How to Play Grand Poo World 3]() Original publisher: [Read original article]() Author: David Walsh Published: 2023-11-28T00:35:41Z Content type: tutorial Language: en Sources: [David Walsh]() Topics: [coding](), [Emulator](), [patches](), [Open Source](), [file]() Tags: [coding](), [emulator](), [game](), [games](), [how-to](), [mario](), [open-source](), [patches]() ### AI overview A tutorial explaining how to assemble the files and utilities needed to patch a clean Super Mario World ROM with Grand Poo World 3, including validation and emulator options for macOS and Windows. ### Source excerpt The underground world of creating and streaming Super Mario World-based ROM hacks continues to gain popularity. This popularity is a tribute to the creativity of gamers and the quality of the original 30 year old video game's mechanics. Over the past decade, incredible ROM hacks like Grand Poo World 1 and 2, Invictus, and Dram [...] The post How to Play Grand Poo World 3 appeared first on David Walsh Blog. ## NP-hard does not mean hard DevFeed: [NP-hard does not mean hard]() Original publisher: [Read original article]() Published: 2017-12-29T13:30:23Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Algorithms, Complexity](), [Algorithms](), [Programming]() Tags: [algorithm](), [algorithms](), [boolean](), [completeness](), [complexity-theory](), [logic](), [mario](), [mathematics](), [np-completeness](), [np-hard](), [problems](), [real-world](), [regular-languages](), [solve](), [time]() ### AI overview This article explains that NP-hardness is a worst-case mathematical property, not a claim that a problem is always difficult for humans or algorithms. Using Super Mario as an example, it shows how game levels can encode boolean logic and why solving the game in full generality would encompass hard computational problems, while ordinary real-world levels may still be solvable efficiently. ### Source excerpt When NP-hardness pops up on the internet, say because some silly blogger wants to write about video games, it's often tempting to conclude that the problem being proved NP-hard is actually very hard! "Scientists proved Super Mario is NP-hard? I always knew there was a reason I wasn't very good at it!" Sorry, these two are unrelated. NP-hardness means hard in a narrow sense this post should hopefully make clear. After that, we'll explore what "hard" means in a mathematical sense that you can apply beyond NP-hardness to inform your work as a programmer. ## How theoretical computer science explains the complexity of puzzle games DevFeed: [How theoretical computer science explains the complexity of puzzle games]() Original publisher: [Read original article]() Published: 2014-03-17T10:00:55Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [computational complexity](), [Algorithms, Complexity](), [Computer science](), [Algorithms](), [Mazes]() Tags: [algorithm](), [art-gallery-problem](), [bin-packing](), [board-games](), [computational-complexity](), [computer](), [computer-science](), [exp](), [game](), [games](), [games-on-graphs](), [graph-coloring](), [greedy-spiders](), [mario](), [nintendo](), [np](), [np-completeness](), [np-hard](), [pancake-flipping](), [pspace](), [puzzle](), [science](), [starcraft](), [video-games]() ### AI overview The article explains that NP-hardness in games describes worst-case computational complexity, not how difficult a game is for human players. It uses examples including Pokémon, Super Mario Bros., Candy Crush Saga, Pac-Man, Doom, Starcraft, Tetris, chess, checkers, and Go to discuss hardness results and practical algorithms. ### Source excerpt Two years ago, Erik Demaine and three other researchers published a fun paper to the arXiv proving that most incarnations of classic nintendo games are NP-hard. This includes almost every Super Mario Brothers, Donkey Kong, and Pokemon title. Back then I wrote a blog post summarizing the technical aspects of their work, and even gave a talk on it to a room full of curious undergraduate math majors. But while bad tech-writers tend to interpret NP-hard as "really really hard," the truth is more complicated. ## Classic Nintendo Games are NP-Hard DevFeed: [Classic Nintendo Games are NP-Hard]() Original publisher: [Read original article]() Published: 2012-03-22T18:34:56Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [Math and Logic](), [Computer science](), [infoarena]() Tags: [complexity](), [computational-complexity](), [computer-science](), [donkey-kong](), [games](), [mario](), [mathematics](), [metroid](), [np-completeness](), [np-hard](), [paper](), [pokemon](), [video-games](), [zelda]() ### AI overview The article explains research showing that generalized versions of several classic Nintendo games, including Mario Brothers, Metroid, Donkey Kong, Pokemon, and The Legend of Zelda, are NP-hard. Some are also classified as NP-complete or PSPACE-complete. It outlines reductions from 3-SAT using game-level gadgets for variables and clauses. ### Source excerpt Problem: Prove that generalized versions of Mario Brothers, Metroid, Donkey Kong, Pokemon, and Legend of Zelda are NP-hard. Solution: http://arxiv.org/abs/1203.1895v1 Discussion: Three researchers (including Erik Demaine, a computer science professor at MIT famous for his work with the mathematics of origami) recently finished a paper giving the complexity of a number of classic Nintendo games (the ones I loved to play). All are proven NP-hard, some are shown to be NP-complete, and some are PSPACE-complete.