Download PDFOpen PDF in browser

Quantified Boolean Formulas: Call the Plumber!

9 pagesPublished: May 4, 2017

Abstract

In this tool paper we describe a variation of Nintendo’s Super Mario World dubbed Super Formula World that creates its game maps based on an input quantified Boolean formula. Thus in Super Formula World, Mario, the plumber not only saves his girlfriend princess Peach, but also acts as a QBF solver as a side. The game is implemented in Java and platform independent. Our implementation rests on abstract frameworks by Aloupis et al. that allow the analysis of the computational complexity of a variety of famous video games. In particular it is a straightforward consequence of these results to provide a reduction from QSAT to Super Mario World. By specifying this reduction in a precise way we obtain the core engine of Super Formula World. Similarly Super Formula World implements a reduction from SAT to Super Mario Bros., yielding significantly simpler game worlds.

Keyphrases: computational complexity, educational logic software, serious games

In: Thomas Eiter and David Sands (editors). LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 46, pages 162--170

Links:
BibTeX entry
@inproceedings{LPAR-21:Quantified_Boolean_Formulas_Call,
  author    = {Josef Lindsberger and Alexander Maringele and Georg Moser},
  title     = {Quantified Boolean Formulas: Call the Plumber!},
  booktitle = {LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Thomas Eiter and David Sands},
  series    = {EPiC Series in Computing},
  volume    = {46},
  pages     = {162--170},
  year      = {2017},
  publisher = {EasyChair},
  bibsource = {EasyChair, http://www.easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/XWg},
  doi       = {10.29007/g8g8}}
Download PDFOpen PDF in browser