Bibliographic Details
| Title: |
The computational complexity of forced capture Hnefatafl. |
| Authors: |
Burke, Kyle1 (AUTHOR) kburke@flsouthern.edu, Tennenhouse, Craig2 (AUTHOR) ctennenhouse@une.edu |
| Source: |
Theoretical Computer Science. Jul2024, Vol. 1006, pN.PAG-N.PAG. 1p. |
| Subjects: |
Games |
| Abstract: |
We define a new asymmetric partizan loopy combinatorial game, Forced-Capture Hnefatafl , similar to Hnefatafl , except that players are forced to make capturing moves when available. We show that this game is PSPACE-hard using a reduction from Positive-CNF , making progress towards classifying the computational complexity of proper Hnefatafl. [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 |
