洪水泛滥的自由有多糟糕?
How Bad is the Freedom to Flood-It?
摘要:
Fixed-Flood-It和Free-Flood-It是图上的组合问题,它们概括了一个非常流行的称为Flood-It的难题。这两个问题都由随机移动组成,其目标是尽可能快地生成单色(“淹没”)图。它们的区别在于,在Free-Flood-It中,玩家可以在每次移动中选择顶点。在本文中,我们将探讨这种自由如何影响问题的复杂性。事实证明,自由在某种意义上是不好的。我们发现,一些情况下平凡可解的固定洪水,它成为棘手的自由洪水,它。我们还表明,一些易于处理的情况下固定洪水,它仍然是易于处理的自由洪水,它,但需要相当多的参与参数。最后,我们提出了一些组合性质连接或分离的两个问题。特别是,我们表明,固定洪水的最佳解决方案的长度总是最多的两倍,自由洪水,它,这是紧。
英文摘要:
Fixed-Flood-It and Free-Flood-It are combinatorial problems on graphs that generalize a very popular puzzle called Flood-It. Both problems consist of recoloring moves whose goal is to produce a monochromatic ("flooded") graph as quickly as possible. Their difference is that in Free-Flood-It the player has the additional freedom of choosing the vertex to play in each move. In this paper, we investigate how this freedom affects the complexity of the problem. It turns out that the freedom is bad in some sense. We show that some cases trivially solvable for Fixed-Flood-It become intractable for Free-Flood-It. We also show that some tractable cases for Fixed-Flood-It are still tractable for Free-Flood-It but need considerably more involved arguments. We finally present some combinatorial properties connecting or separating the two problems. In particular, we show that the length of an optimal solution for Fixed-Flood-It is always at most twice that of Free-Flood-It, and this is tight.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。