A reduced computational complexity strategy for the Magnus-Derek game

Zhivko Nedev
2014 International Mathematical Forum  
We analyze the Magnus-Derek game, a two-player game played on a round table having n positions. The players jointly control the movement of a token. One player aims to minimize the number of positions visited, and the other aims to maximize this quantity. We give an f * (n) + log 2 (m − 1) f * (m)round strategy, where p is the smallest odd prime factor of n, m = n p , and f * is a function yielding the number of positions visited when both players play optimally. This strategy requires
more » ... y requires significantly less computation time than the previously published strategies.
doi:10.12988/imf.2014.411 fatcat:iu4yp5werbhntcygoy3ho7vjie