License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2023.16
URN: urn:nbn:de:0030-drops-190100
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/19010/
Avni, Guy ;
Ghorpade, Pranav ;
Guha, Shibashis
A Game of Pawns
Abstract
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.
BibTeX - Entry
@InProceedings{avni_et_al:LIPIcs.CONCUR.2023.16,
author = {Avni, Guy and Ghorpade, Pranav and Guha, Shibashis},
title = {{A Game of Pawns}},
booktitle = {34th International Conference on Concurrency Theory (CONCUR 2023)},
pages = {16:1--16:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-299-0},
ISSN = {1868-8969},
year = {2023},
volume = {279},
editor = {P\'{e}rez, Guillermo A. and Raskin, Jean-Fran\c{c}ois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/19010},
URN = {urn:nbn:de:0030-drops-190100},
doi = {10.4230/LIPIcs.CONCUR.2023.16},
annote = {Keywords: Graph games, Reachability games, Pawn games, Dynamic vertex control}
}
|
Keywords: |
|
Graph games, Reachability games, Pawn games, Dynamic vertex control |
|
Collection: |
|
34th International Conference on Concurrency Theory (CONCUR 2023) |
|
Issue Date: |
|
2023 |
|
Date of publication: |
|
07.09.2023 |
