Add to ORKGWe prove NP-hardness results for five of Nintendo’s largest video game franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokémon. Our results apply to generalized versions of Super Mario Bros. 1–3, The Lost Levels, and Super Mario World; Donkey Kong Country 1–3; all Legend of Zelda games; all Metroid games; and all Pokémon role-playing games. In addition, we prove PSPACE-completeness of the Donkey Kong Country games and several Legend o
Single-player games (often called puzzles) have received considerable attention from the scientific ...
© 2020 Information Processing Society of Japan. We prove that the classic falling-block video game T...
We prove that the classic 1994 Taito video game, known as Puzzle Bobble or Bust-a-Move, is NP-comple...
We prove NP-hardness results for five of Nintendo's largest video game franchises: Mario, Donkey Kon...
We prove NP-hardness results for five of Nintendo’s largest video game franchises: Mario, Donkey Kon...
We prove NP-hardness results for five of Nintendo’s largest video game franchises: Mario
The complexity of (classic Nintendo) games like Super Mario Bros., Donkey Kong Country and Metroid h...
Mario is back! In this sequel, we prove that solving a generalized level of Super Mario Bros. is PSP...
Nintendo’s Mario Kart is perhaps the most popular racing video game franchise. Players race alone or...
© Erik D. Demaine, Joshua Lockhart, and Jayson Lynch; licensed under Creative Commons License CC-BY ...
We classify the computational complexity of the popular video games Portal and Portal 2. We isolate ...
International audienceThe game of Go is often said to exptime-complete. The result refers to classic...
AbstractWe prove NP-hardness of six families of naturally defined, interesting board games. Some of ...
We prove that a variant of 2048, a popular online puzzle game, is PSPACE-Complete. Our hardness resu...
The twentieth century has seen the rise of a new type of video games targeted at a mass audience of ...
Single-player games (often called puzzles) have received considerable attention from the scientific ...
© 2020 Information Processing Society of Japan. We prove that the classic falling-block video game T...
We prove that the classic 1994 Taito video game, known as Puzzle Bobble or Bust-a-Move, is NP-comple...
We prove NP-hardness results for five of Nintendo's largest video game franchises: Mario, Donkey Kon...
We prove NP-hardness results for five of Nintendo’s largest video game franchises: Mario, Donkey Kon...
We prove NP-hardness results for five of Nintendo’s largest video game franchises: Mario
The complexity of (classic Nintendo) games like Super Mario Bros., Donkey Kong Country and Metroid h...
Mario is back! In this sequel, we prove that solving a generalized level of Super Mario Bros. is PSP...
Nintendo’s Mario Kart is perhaps the most popular racing video game franchise. Players race alone or...
© Erik D. Demaine, Joshua Lockhart, and Jayson Lynch; licensed under Creative Commons License CC-BY ...
We classify the computational complexity of the popular video games Portal and Portal 2. We isolate ...
International audienceThe game of Go is often said to exptime-complete. The result refers to classic...
AbstractWe prove NP-hardness of six families of naturally defined, interesting board games. Some of ...
We prove that a variant of 2048, a popular online puzzle game, is PSPACE-Complete. Our hardness resu...
The twentieth century has seen the rise of a new type of video games targeted at a mass audience of ...
Single-player games (often called puzzles) have received considerable attention from the scientific ...
© 2020 Information Processing Society of Japan. We prove that the classic falling-block video game T...
We prove that the classic 1994 Taito video game, known as Puzzle Bobble or Bust-a-Move, is NP-comple...