An O(n)-Round Strategy for the Magnus-Derek Game
AbstractWe 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
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Nedev, Z. An O(n)-Round Strategy for the Magnus-Derek Game. Algorithms 2010, 3, 244-254.
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.