An O(n)-Round Strategy for the Magnus-Derek Game

Algorithms

关键词: algorithmic game theory;    additive combinatorics;    combinatorial games;   

DOI  :  10.3390/a3030244

来源: DOAJ

【 摘 要 】

We analyze further the Magnus-Derek game, a two-player game played on a round table with n positions. The players jointly control the movement of a token. One player, Magnus, aims to maximize the number of positions visited while minimizing the number of rounds. The other player, Derek, attempts to minimize the number of visited positions. We present a new strategy for Magnus that succeeds in visiting the maximal number of positions in 3(n – 1) rounds, which is the optimal number of rounds up to a constant factor.

【 授权许可】

Unknown