Next Article in Journal
Ray Solomonoff (1926-2009)
Previous Article in Journal
Segment LLL Reduction of Lattice Bases Using Modular Arithmetic
Open AccessArticle

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

International University VNU-HCM, Block 6, Linh Trung Ward, Thu Duc District, HCM City, Vietnam
Algorithms 2010, 3(3), 244-254; https://doi.org/10.3390/a3030244
Received: 8 June 2010 / Revised: 6 July 2010 / Accepted: 8 July 2010 / Published: 15 July 2010
(This article belongs to the Special Issue Algorithmic Game Theory)
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. View Full-Text
Keywords: algorithmic game theory; additive combinatorics; combinatorial games algorithmic game theory; additive combinatorics; combinatorial games
MDPI and ACS Style

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

Show more citation formats Show less citations formats

Article Access Map

1
Only visits after 24 November 2015 are recorded.
Back to TopTop