A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers
Abstract: In this paper, we address a natural question at the intersection of combinatorial game theory and computational complexity: "Can a sum of simple tepid games in canonical form be intractable?" To resolve this fundamental question, we consider superstars, positions first introduced in Winning Ways where all options are nimbers. Extending Morris' classic result with hot games to tepid games, we prove that disjunctive sums of superstars are intractable to solve. This is striking as sums of nimbers can be computed in linear time. Our analyses also lead to a family of elegant board games with intriguing complexity, for which we present web-playable versions of the rulesets described within.
- Lessons in Play: An Introduction to Combinatorial Game Theory. A. K. Peters, Wellesley, Massachusetts, 2007.
- Winning Ways for your Mathematical Plays, volume 1. A K Peters, Wellesley, Massachsetts, 2001.
- Charles L. Bouton. Nim, a game with a complete mathematical theory. Annals of Mathematics, 3(1/4):pp. 35–39, 1901. URL: http://www.jstor.org/stable/1967631.
- Winning the war by (strategically) losing battles: Settling the complexity of Grundy-values in undirected geography. In Proceedings of the 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2021.
- J.H. Conway. On Numbers and Games. A.K. Peters. A.K. Peters, 2000. URL: https://books.google.com/books?id=tXiVo8qA5PQC.
- Undirected edge geography. Theor. Comput. Sci., 112(2):371–381, 1993.
- Some simplified np-complete problems. In Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, STOC ’74, page 47–63, New York, NY, USA, 1974. Association for Computing Machinery. doi:10.1145/800119.803884.
- P. M. Grundy. Mathematics and games. Eureka, 2:198—211, 1939.
- David Moews. On some combinatorial games connected with Go. PhD thesis, Citeseer, 1993.
- FL Morris. Playing disjunctive sums is polynomial space complete. International Journal of Game Theory, 10(3-4):195–205, 1981.
- Thomas J. Schaefer. The complexity of satisfiability problems. In Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC ’78, page 216–226, New York, NY, USA, 1978. Association for Computing Machinery. doi:10.1145/800133.804350.
- A.N. Siegel. Combinatorial Game Theory. Graduate Studies in Mathematics. American Mathematical Society, 2013. URL: https://books.google.com/books?id=VUVrAAAAQBAJ.
- Disjunctive sums of quasi-nimbers. Theoretical Computer Science, 945:113665, 2023. URL: https://www.sciencedirect.com/science/article/pii/S030439752200737X, doi:10.1016/j.tcs.2022.12.015.
- R. P. Sprague. Über mathematische Kampfspiele. Tôhoku Mathematical Journal, 41:438—444, 1935-36.
- David Wolfe. Go endgames are PSPACE-hard. In Richard J. Nowakowski, editor, More Games of No Chance, volume 42 of Mathematical Sciences Research Institute Publications, pages 125–136. Cambridge University Press, 2002.
- Laura Jo Yedwab. On playing well in a sum of games. PhD thesis, Massachusetts Institute of Technology, 1985.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.