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.
Cite
@article{arxiv.1712.04496,
title = {Computational Properties of Slime Trail},
author = {Matthew Ferland and Kyle Burke},
journal= {arXiv preprint arXiv:1712.04496},
year = {2017}
}