The computational complexity of Evil Hangman

DOI10.4230/LIPICS.FUN.2021.23MaRDI QIDQ6487596zbMATH OpenFDO

Authors Jérémy Barbay, Bernardo Subercaseaux

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.FUN.2021.23

zbMATH Keywords

combinatorial game theorycomputational complexitydecidability

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46) Algorithmic game theory and complexity (91A68)

Recommendations

• Hanabi is NP-complete, even for cheaters who look at their cards
• Computational complexity of generalized Push Fight
• On the computational complexities of various geography variants
• The computational complexity of the game of Set and its theoretical applications
• Gaming is a hard job, but someone has to do it!

Cited in

(1)

• The computational complexity of Angry Birds

This page was built for publication: The computational complexity of Evil Hangman

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487596)