Computational Properties of Slime Trail

12/12/2017
by   Matthew Ferland, et al.
0

We investigate the combinatorial game Slime Trail.This game is played on a graph with a starting piece in a node. Each player's objective is to reach one of their own goal nodes. Every turn the current player moves the piece and deletes the node they came from. We show that the game is PSPACE-complete when played on a planar graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/18/2019

On the Complexity of 2-Player Packing Games

We analyze the computational complexity of two 2-player games involving ...
research
07/25/2018

Maker-Breaker domination game

We introduce the Maker-Breaker domination game, a two player game on a g...
research
03/28/2022

Chess is hard even for a single player

We introduce a generalization of "Solo Chess", a single-player variant o...
research
03/24/2021

The combinatorial game nofil played on Steiner Triple Systems

We introduce an impartial combinatorial game on Steiner triple systems c...
research
02/02/2023

Complexity of Solo Chess with Unlimited Moves

We analyze Solo Chess puzzles, where the input is an n × n board contain...
research
06/03/2022

Prophecy Variables for Hyperproperty Verification

Temporal logics for hyperproperties like HyperLTL use trace quantifiers ...
research
02/04/2012

e-Valuate: A Two-player Game on Arithmetic Expressions -- An Update

e-Valuate is a game on arithmetic expressions. The players have contrast...

Please sign up or login with your details

Forgot password? Click here to reset