A Game of Pawns

05/06/2023
by   Guy Avni, et al.
0

We introduce and study pawn games, a class of two-player zero-sum turn-based graph games. A turn-based graph game proceeds by placing a token on an initial vertex, and whoever controls the vertex on which the token is located, chooses its next location. This leads to a path in the graph, which determines the winner. Traditionally, the control of vertices is predetermined and fixed. The novelty of pawn games is that control of vertices changes dynamically throughout the game as follows. Each vertex of a pawn game is owned by a pawn. In each turn, the pawns are partitioned between the two players, and the player who controls the pawn that owns the vertex on which the token is located, chooses the next location of the token. Control of pawns changes dynamically throughout the game according to a fixed mechanism. Specifically, we define several grabbing-based mechanisms in which control of at most one pawn transfers at the end of each turn. We study the complexity of solving pawn games, where we focus on reachability objectives and parameterize the problem by the mechanism that is being used and by restrictions on pawn ownership of vertices. On the positive side, even though pawn games are exponentially-succinct turn-based games, we identify several natural classes that can be solved in PTIME. On the negative side, we identify several EXPTIME-complete classes, where our hardness proofs are based on a new class of games called lock Key games, which may be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/24/2022

Bidding Graph Games with Partially-Observable Budgets

Two-player zero-sum "graph games" are a central model, which proceeds as...
research
07/17/2023

Fast Algorithms for Energy Games in Special Cases

In this paper, we study algorithms for special cases of energy games, a ...
research
07/27/2023

Reachability Poorman Discrete-Bidding Games

We consider bidding games, a class of two-player zero-sum graph games. T...
research
08/20/2021

On the Computational Complexities of Various Geography Variants

Generalized Geography is a combinatorial game played on a directed graph...
research
09/22/2022

Solving the General Case of Rank-3 Maker-Breaker Games in Polynomial Time

A rank-3 Maker-Breaker game is played on a hypergraph in which all hyper...
research
10/15/2022

AI-powered tiebreak mechanisms: An application to chess

In this paper, we propose that AI systems serve as a judge in the event ...
research
07/20/2016

Optimising Rule-Based Classification in Temporal Data

This study optimises manually derived rule-based expert system classific...

Please sign up or login with your details

Forgot password? Click here to reset