Bibliographic Details
| Title: |
A tractability gap beyond nim-sums: It's hard to tell whether a bunch of superstars are losers. |
| Authors: |
Burke, Kyle1 (AUTHOR) kburke@flsouthern.edu, Ferland, Matthew2 (AUTHOR) ferlandm@dickinson.edu, Huntemann, Svenja1,3 (AUTHOR) svenja.huntemann@msvu.ca, Teng, Shang-Hua4 (AUTHOR) shanghua@usc.edu |
| Source: |
Theoretical Computer Science. Feb2026, Vol. 1062, pN.PAG-N.PAG. 1p. |
| Subjects: |
Game theory, Computational complexity, Games |
| 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 analysis shows that the game Paint Can is intractable and also yields a new intractable game, Blackout. We present web-playable versions of both games. [ABSTRACT FROM AUTHOR] |
|
Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
