DIMACS TR: 2005-22

The Nagger-Mover Game

Authors: Z. Nedev and S. Muthukrishnan


We introduce a new two-persons game. Nagger starts from position 0 in a round table with positions marked $0,1,\ldots,n-1$ and repeatedly calls number of places to move, and Mover responds to each move with which direction---clockwise or anticlockwise---that the Nagger should move. What is the maximum number of positions that Nagger may occupy? We provide the exact bound for this question, provide algorithmic strategies for the Nagger and the Mover to meet this bound, and pose other variants of the Nagger-Mover game for future study.

Paper Available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2005/2005-22.ps.gz
DIMACS Home Page