Computational Properties of Slime Trail
Matthew Ferland, Kyle Burke
TL;DR
This paper analyzes the combinatorial game Slime Trail, proving it is PSPACE-complete on planar graphs, highlighting its computational complexity and strategic depth.
Contribution
It establishes the PSPACE-completeness of Slime Trail on planar graphs, a novel complexity result for this game.
Findings
Slime Trail is PSPACE-complete on planar graphs.
The game involves strategic node deletion and pathfinding.
Complexity results inform game strategy and computational limits.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Computational Geometry and Mesh Generation · Data Visualization and Analytics