arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1712.01330cs.CC
收藏

记忆游戏的时空权衡

Time-Space Tradeoffs for the Memory Game

Amit Chakrabarti, Yining Chen

摘要:

一个单人游戏的记忆是发挥与$n$不同对卡,卡在每对轴承相同的图片。牌是正面朝下的。移动包括显示两张牌,适应性地选择。如果这些卡片匹配,即,它们带有相同的图片,它们将从游戏中移除;否则,它们将被转回来面朝下。游戏的目的是清除所有的卡,同时尽量减少移动的次数。过去的作品已经彻底研究了所需的移动的预期数量,假设最佳发挥的球员有完美的记忆。在这项工作中,我们研究了记忆游戏中的空间有界设置。我们证明了两个时间-空间权衡算法(策略的球员),清除所有卡在$T$移动,同时使用最多$S$位的内存上的下限。首先,在一个简单的模型,在卡上的图片可能只比较平等,我们证明了$ST = Ω(n^2 \log n)$。这是严格的:在这个权衡曲线上的任何地方都很容易实现$ST = O(n^2 \log n)$。其次,在一个更一般的模型,允许任意计算,我们证明了$ST^2 = Ω(n^3)$。我们证明了后者的权衡建模策略的分支程序和扩展经典的计数参数的鲍罗丁和库克与一个新的概率参数。我们推测,更强的权衡$ST = \widetildeΩ(n^2)$,事实上,甚至在这个一般模型。

英文摘要:

A single-player game of Memory is played with $n$ distinct pairs of cards, with the cards in each pair bearing identical pictures. The cards are laid face-down. A move consists of revealing two cards, chosen adaptively. If these cards match, i.e., they bear the same picture, they are removed from play; otherwise, they are turned back to face down. The object of the game is to clear all cards while minimizing the number of moves. Past works have thoroughly studied the expected number of moves required, assuming optimal play by a player has that has perfect memory. In this work, we study the Memory game in a space-bounded setting. We prove two time-space tradeoff lower bounds on algorithms (strategies for the player) that clear all cards in $T$ moves while using at most $S$ bits of memory. First, in a simple model where the pictures on the cards may only be compared for equality, we prove that $ST = Ω(n^2 \log n)$. This is tight: it is easy to achieve $ST = O(n^2 \log n)$ essentially everywhere on this tradeoff curve. Second, in a more general model that allows arbitrary computations, we prove that $ST^2 = Ω(n^3)$. We prove this latter tradeoff by modeling strategies as branching programs and extending a classic counting argument of Borodin and Cook with a novel probabilistic argument. We conjecture that the stronger tradeoff $ST = \widetildeΩ(n^2)$ in fact holds even in this general model.

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

↑