Computational Properties of Slime Trail
classification
💻 cs.CC
math.CO
keywords
gamegraphnodepieceplayedplayerslimetrail
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.