Algorithms 2010, 3(3), 244-254; doi:10.3390/a3030244

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

Received: 8 June 2010; in revised form: 6 July 2010 / Accepted: 8 July 2010 / Published: 15 July 2010
(This article belongs to the Special Issue Algorithmic Game Theory)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: 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.
Keywords: algorithmic game theory; additive combinatorics; combinatorial games
PDF Full-text Download PDF Full-Text [241 KB, uploaded 15 July 2010 10:28 CEST]

Export to BibTeX |

MDPI and ACS Style

Nedev, Z. An O(n)-Round Strategy for the Magnus-Derek Game. Algorithms 2010, 3, 244-254.

AMA Style

Nedev Z. An O(n)-Round Strategy for the Magnus-Derek Game. Algorithms. 2010; 3(3):244-254.

Chicago/Turabian Style

Nedev, Zhivko. 2010. "An O(n)-Round Strategy for the Magnus-Derek Game." Algorithms 3, no. 3: 244-254.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert