Document Open Access Logo

Coordinating "7 Billion Humans" Is Hard

Authors Alessandro Panconesi , Pietro Maria Posta , Mirko Giacchini

PDF
Thumbnail PDF

File

LIPIcs.FUN.2024.26.pdf
  • Filesize: 1.28 MB
  • 16 pages

Document Identifiers

Author Details

Alessandro Panconesi
  • Sapienza University of Rome, Italy
Pietro Maria Posta
  • Sapienza University of Rome, Italy
Mirko Giacchini
  • Sapienza University of Rome, Italy

Cite AsGet BibTex

Alessandro Panconesi, Pietro Maria Posta, and Mirko Giacchini. Coordinating "7 Billion Humans" Is Hard. In 12th International Conference on Fun with Algorithms (FUN 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 291, pp. 26:1-26:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.FUN.2024.26

Abstract

In the video game "7 Billion Humans", the player is requested to direct a group of workers to various destinations by writing a program that is executed simultaneously on each worker. While the game is quite rich and, indeed, it is considered one of the best games for beginners to learn the basics of programming, we show that even extremely simple versions are already NP-Hard or PSPACE-Hard.

Subject Classification

ACM Subject Classification
  • Theory of computation → Complexity classes
Keywords
  • video games
  • computational complexity
  • NP
  • PSPACE

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Matteo Almanza, Stefano Leucci, and Alessandro Panconesi. Trainyard is np-hard. Theoretical Computer Science, 2018. FUN with Algorithms. Google Scholar
  2. Matteo Almanza, Stefano Leucci, and Alessandro Panconesi. Tracks from hell — when finding a proof may be easier than checking it. Theoretical Computer Science, 2020. FUN with Algorithms. Google Scholar
  3. Greg Aloupis, Erik D. Demaine, Alan Guo, and Giovanni Viglietta. Classic nintendo games are (computationally) hard. Theoretical Computer Science, 2015. FUN with Algorithms. Google Scholar
  4. Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, and Petra Wolf. On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), 2021. Google Scholar
  5. Erik D. Demaine, Joshua Lockhart, and Jayson Lynch. The computational complexity of portal and other 3d video games. FUN with Algorithms, 2018. Google Scholar
  6. Erik D. Demaine, Giovanni Viglietta, and Aaron Williams. Super mario bros. is harder/easier than we thought. FUN with Algorithms, 2016. Google Scholar
  7. Stefan Funke, André Nusser, and Sabine Storandt. The simultaneous maze solving problem. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017. Google Scholar
  8. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979. Google Scholar
  9. Luciano Gualà, Stefano Leucci, and Emanuele Natale. Bejeweled, candy crush and other match-three games are (np-)hard. 2014 IEEE Conference on Computational Intelligence and Games, 2014. Google Scholar
  10. Graham Kendall, Andrew Parkes, and Kristian Spoerer. A survey of np-complete puzzles. ICGA Journal, 2008. Google Scholar
  11. Dexter Kozen. Lower bounds for natural proof systems. In 18th Annual Symposium on Foundations of Computer Science (FOCS), 1977. Google Scholar
  12. Klaus-Jörn Lange and Peter Rossmanith. The emptiness problem for intersections of regular languages. In Mathematical Foundations of Computer Science, 1992. Google Scholar
  13. Walter J. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences, 4(2), 1970. Google Scholar
  14. Giovanni Viglietta. Gaming is a hard job, but someone has to do it! In Fun with Algorithms, 2012. Google Scholar
  15. Michael Wehar. Hardness results for intersection non-emptiness. In Automata, Languages, and Programming (ICALP), 2014. Google Scholar
  16. Commonsense review. https://www.commonsense.org/education/reviews/7-billion-humans. Accessed: 2024-02-26.
  17. Hackr review. https://hackr.io/blog/coding-games. Accessed: 2024-02-26.
  18. Hubspot review. https://blog.hubspot.com/website/best-coding-games. Accessed: 2024-02-26.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact