Abstract
The classic TQBF problem is to determine who has a winning strategy in a game played on a given conjunctive normal form formula (CNF), where the two players alternate turns picking truth values for the variables in a given order, and the winner is determined by whether the CNF gets satisfied. We study variants of this game in which the variables may be played in any order, and each turn consists of picking a remaining variable and a truth value for it.
For the version where the set of variables is partitioned into two halves and each player may only pick variables from his or her half, we prove that the problem is PSPACE-complete for 5-CNFs and in P for 2-CNFs. Previously, it was known to be PSPACE-complete for unbounded-width CNFs (Schaefer, STOC 1976). For the general unordered version (where each variable can be picked by either player), we also prove that the problem is PSPACE-complete for 5-CNFs and in P for 2-CNFs. Previously, it was known to be PSPACE-complete for 6-CNFs (Ahlroth and Orponen, MFCS 2012) and PSPACE-complete for positive 11-CNFs (Schaefer, STOC 1976).
- Lauri Ahlroth and Pekka Orponen. 2012. Unordered constraint satisfaction games. In Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS’12). 64--75.Google Scholar
Digital Library
- Argimiro Arratia and Iain Stewart. 2003. A note on first-order projections and games. Theoretical Computer Science 290, 3 (2003), 2085--2093.Google Scholar
Digital Library
- Bengt Aspvall, Michael Plass, and Robert Tarjan. 1979. A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters 8, 3 (1979), 121--123.Google Scholar
Cross Ref
- Boštjan Brešar, Paul Dorbec, Sandi Klavžar, Gašper Košmrlj, and Gabriel Renault. 2016. Complexity of the game domination problem. Theoretical Computer Science 648 (2016), 1--7.Google Scholar
Digital Library
- Kyle Burke, Erik Demaine, Harrison Gregg, Robert Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, et al. 2015. Single-player and two-player buttons and scissors games. In Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG’15). 60--72.Google Scholar
- William Burley and Sandy Irani. 1997. On algorithm design for metrical task systems. Algorithmica 18, 4 (1997), 461--485.Google Scholar
Cross Ref
- Jesper Byskov. 2004. Maker-Maker and Maker-Breaker Games Are PSPACE-Complete. Technical Report RS-04-14. BRICS, Department of Computer Science, Aarhus University.Google Scholar
- Chris Calabro. 2008. 2-TQBF Is in P. Retrieved May 6, 2020 from https://cseweb.ucsd.edu/ ccalabro/essays/complexity_of_2tqbf.pdf.Google Scholar
- Stephen Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, and Thomas Thierauf. 2015. Game values and computational complexity: An analysis via black-white combinatorial games. In Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC’15). 689--699.Google Scholar
Cross Ref
- Aviezri Fraenkel and Elisheva Goldschmidt. 1987. PSPACE-hardness of some combinatorial games. Journal of Combinatorial Theory, Series A 46, 1 (1987), 21--38.Google Scholar
Digital Library
- Robert Hearn. 2009. Amazons, Konane, and cross purposes are PSPACE-complete. In Games of No Chance 3. Cambridge University Press, 287--306.Google Scholar
- Md Lutfar Rahman and Thomas Watson. 2019. Tractable Unordered 3-CNF Games. Technical Report TR19-160. Electronic Colloquium on Computational Complexity (ECCC). https://eccc.weizmann.ac.il/report/2019/160/.Google Scholar
- Thomas Schaefer. 1976. Complexity of decision problems based on finite two-person perfect-information games. In Proceedings of the 8th Symposium on Theory of Computing (STOC’76). ACM, New York, NY, 41--49.Google Scholar
Digital Library
- Thomas Schaefer. 1978. On the complexity of some two-person perfect-information games. Journal of Computer and System Sciences 16, 2 (1978), 185--225.Google Scholar
Cross Ref
- Wolfgang Slany. 2000. The complexity of graph Ramsey games. In Proceedings of the 2nd International Conference on Computers and Games (CG’00). 186--203.Google Scholar
- Wolfgang Slany. 2002. Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. Theoretical Computer Science 289, 1 (2002), 829--843.Google Scholar
Digital Library
- Larry Stockmeyer and Albert Meyer. 1973. Word problems requiring exponential time. In Proceedings of the 5th Symposium on Theory of Computing (STOC’73). ACM, New York, NY, 1--9.Google Scholar
- Robert Tarjan. 1972. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1, 2 (1972), 146--160.Google Scholar
Digital Library
- Sachio Teramoto, Erik Demaine, and Ryuhei Uehara. 2011. The Voronoi game on graphs and its complexity. Journal of Graph Algorithms and Applications 15, 4 (2011), 485--501.Google Scholar
Cross Ref
- Jan van Rijn and Jonathan Vis. 2013. Complexity and retrograde analysis of the game Dou Shou Qi. In Proceedings of the 25th Benelux Conference on Artificial Intelligence (BNAIC’13).Google Scholar
- Ling Zhao and Martin Müller. 2004. Game-SAT: A preliminary report. In Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing (SAT’04). 357--362.Google Scholar
Index Terms
Complexity of Unordered CNF Games
Recommendations
Tractable Unordered 3-CNF Games
LATIN 2020: Theoretical InformaticsAbstractThe classic TQBF problem can be viewed as a game in which two players alternate turns assigning truth values to a CNF formula’s variables in a prescribed order, and the winner is determined by whether the CNF gets satisfied. The complexity of ...
A decomposition method for CNF minimality proofs
A CNF is minimal if no shorter CNF representing the same function exists, where by CNF length we mean either the number of clauses or the total number of literals (sum of clause lengths). In this paper we develop a decomposition approach that can be in ...






Comments