View in EDS

The computational complexity of forced capture Hnefatafl.

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 177843786
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: The computational complexity of forced capture Hnefatafl.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Burke%2C+Kyle%22">Burke, Kyle</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> kburke@flsouthern.edu</i><br /><searchLink fieldCode="AR" term="%22Tennenhouse%2C+Craig%22">Tennenhouse, Craig</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> ctennenhouse@une.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Theoretical+Computer+Science%22">Theoretical Computer Science</searchLink>. Jul2024, Vol. 1006, pN.PAG-N.PAG. 1p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Games%22">Games</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=177843786
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.tcs.2024.114627
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 1
        StartPage: N.PAG
    Subjects:
      – SubjectFull: Games
        Type: general
    Titles:
      – TitleFull: The computational complexity of forced capture Hnefatafl.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Burke, Kyle
      – PersonEntity:
          Name:
            NameFull: Tennenhouse, Craig
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 27
              M: 07
              Text: Jul2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 03043975
          Numbering:
            – Type: volume
              Value: 1006
          Titles:
            – TitleFull: Theoretical Computer Science
              Type: main
ResultId 1