arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1712.04496cs.CCmath.CO
收藏

黏粒尾迹的计算特性

Computational Properties of Slime Trail

Matthew Ferland, Kyle Burke

摘要:

我们研究了组合博弈Slime Trail,这个博弈是在一个图上进行的,起点在一个节点上。每个玩家的目标是到达自己的目标节点之一。每回合当前玩家移动棋子并删除它们来自的节点。我们表明,游戏是PSPACE完全的平面图上播放时。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑