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

The Magnus-Derek game, a two-player game with n positions played on a round table, is examined further. The mobility of a token is controlled by the players collectively. Magnus, for example, wants to visit as many positions as possible while reducing the amount of rounds. Derek, the other player, tries to reduce the number of spots visited. We propose a novel Magnus strategy that allows him to visit the most locations in 3(n – 1) rounds, the optimum number of rounds up to a constant factor.

Author(S) Details

Zhivko Nedev
International University VNU-HCM, Block 6, Linh Trung Ward, Thu Duc District, HCM City, Vietnam.

View Book:- https://stm.bookpi.org/RAMRCS-V10/article/view/6302