Clobber的线性时间算法
Linear time algorithms for Clobber
摘要：
我们证明了单人游戏clobber是可解的线性时间时，发挥了一条线或一个周期。为了这个目的，我们表明，这个游戏是相当于一个优化问题的一组字定义的7类禁止模式。我们还证明，发挥循环，它总是可以删除至少2n/3的棋子，我们给出了一个构象，它是不可能做得更好，回答最近问的问题法里亚等人。
英文摘要：
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimization problem on a set of words defined by seven classes of forbidden patterns. We also prove that, playing on the cycle, it is always possible to remove at least 2n/3 pawns, and we give a conformation for which it is not possible to do better, answering questions recently asked by Faria et al.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
