Computational Properties of Slime Trail.
arXiv: Computational Complexity（2017）
摘要
We investigate the combinatorial game Slime Trail.This game is played on a graph with a starting piece in a node. Each playeru0027s 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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要