DeepAI AI Chat
Log In Sign Up

On the Computational Complexities of Various Geography Variants

by   Nathan Fox, et al.

Generalized Geography is a combinatorial game played on a directed graph. Players take turns moving a token from vertex to vertex, deleting a vertex after moving the token away from it. A player unable to move loses. It is well known that the computational complexity of determining which player should win from a given position of Generalized Geography is PSPACE-complete. We introduce several rule variants to Generalized Geography, and we explore the computational complexity of determining the winner of positions of many resulting games. Among our results is a proof that determining the winner of a game known in the literature as Undirected Partizan Geography is PSPACE-complete, even when restricted to being played on a bipartite graph.


page 1

page 2

page 3

page 4


On The Complexity of Distance-d Independent Set Reconfiguration

For a fixed positive integer d ≥ 2, a distance-d independent set (DdIS) ...

Maker-Breaker domination game

We introduce the Maker-Breaker domination game, a two player game on a g...

Bidding Graph Games with Partially-Observable Budgets

Two-player zero-sum "graph games" are a central model, which proceeds as...

Iterative Computation of Security Strategies of Matrix Games with Growing Action Set

This paper studies how to efficiently update the saddle-point strategy, ...

Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs

A rotor walk in a directed graph can be thought of as a deterministic ve...

The general position avoidance game and hardness of general position games

Given a graph G, a set S of vertices in G is a general position set if n...

The Complexity of Online Graph Games

Online computation is a concept to model uncertainty where not all infor...