Dags节点阻塞的复杂性
The Complexity of Node Blocking for Dags
摘要:
我们考虑以下称为节点阻塞的湮灭博弈的修改。给定一个有向图,每个顶点最多可以被一个标记占用。有两种类型的代币,每个玩家可以移动他的代币类型。玩家交替移动,当前玩家$i$选择一个类型为$i$的标记,并将该标记沿有向边移动到未占用的顶点。如果一个玩家不能移动,那么他就输了。我们考虑的问题,确定游戏的复杂性:给定一个任意配置的令牌在有向无环图,当前的玩家有一个获胜的策略?我们证明了这个问题是PSPACE-完全的。
英文摘要:
We consider the following modification of annihilation game called node blocking. Given a directed graph, each vertex can be occupied by at most one token. There are two types of tokens, each player can move his type of tokens. The players alternate their moves and the current player $i$ selects one token of type $i$ and moves the token along a directed edge to an unoccupied vertex. If a player cannot make a move then he loses. We consider the problem of determining the complexity of the game: given an arbitrary configuration of tokens in a directed acyclic graph, does the current player has a winning strategy? We prove that the problem is PSPACE-complete.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。