6-Uniform maker-breaker game is PSPACE-complete

Authors

Md Lutfar Rahman, University of Memphis
Thomas Watson, University of Memphis

Abstract

In a STOC 1976 paper, Schaefer proved that it is PSPACE-complete to determine the winner of the so-called Maker-Breaker game on a given set system, even when every set has size at most 11. Since then, there has been no improvement on this result. We prove that the game remains PSPACE-complete even when every set has size 6.

Publication Title

Leibniz International Proceedings in Informatics, LIPIcs

Recommended Citation

Rahman, M., & Watson, T. (2021). 6-Uniform maker-breaker game is PSPACE-complete. Leibniz International Proceedings in Informatics, LIPIcs, 187 https://doi.org/10.4230/LIPIcs.STACS.2021.57