DIKUL - logo
E-viri
Celotno besedilo
Recenzirano
  • The computational complexit...
    Burke, Kyle; Tennenhouse, Craig

    Theoretical computer science, 07/2024, Letnik: 1006
    Journal Article

    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.