Forced Capture Hnefatafl

01/15/2023
by   Kyle Burke, et al.
0

We define a new, 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 Constraint Logic, making progress towards classifying proper Hnefatafl.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/22/2020

Differential games, locality and model checking for FO logic of graphs

We introduce differential games for FO logic of graphs, a variant of Ehr...
research
01/13/2020

Nmbr9 as a Constraint Programming Challenge

Modern board games are a rich source of interesting and new challenges f...
research
12/20/2022

Vexing Vexillological Logic

We define a new impartial combinatorial game, Flag Coloring, based on fl...
research
06/19/2022

The Game of Tumbleweed is PSPACE-complete

Tumbleweed is a popular two-player perfect-information new territorial g...
research
04/02/2023

A complete solution for a nontrivial ruleset with entailing moves

Combinatorial Game Theory typically studies sequential rulesets with per...
research
12/29/2020

Perimeter-defense Game between Aerial Defender and Ground Intruder

We study a variant of pursuit-evasion game in the context of perimeter d...
research
09/22/2017

Kidnapping Model: An Extension of Selten's Game

Selten's game is a kidnapping model where the probability of capturing t...

Please sign up or login with your details

Forgot password? Click here to reset