A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is
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 requiresdoi:10.12988/imf.2014.411 fatcat:iu4yp5werbhntcygoy3ho7vjie