Kayles on the Way to the Stars

We present several new results on the impartial two-person game Kayles. The original version is played on a row of pins (“kayles”). We investigate variants of the game played on graphs. We solve a previously stated open problem in proving that determining the value of a game position needs only polynomial time in a star of bounded degree, and therefore finding the winning move – if one exists – can be done in linear time based on the data calculated before.

[1]  Dieter Kratsch,et al.  Kayles and Nimbers , 2002, J. Algorithms.

[2]  Mikio Kano,et al.  Edge-removing games of star type , 1996, Discret. Math..

[3]  J. Conway On Numbers and Games , 1976 .

[4]  Cedric A. B. Smith,et al.  The G-values of various games , 1956, Mathematical Proceedings of the Cambridge Philosophical Society.

[5]  K. Kawachi,et al.  A Numerical Study of Insect Flight , 1998 .

[6]  Thomas J. Schaefer,et al.  On the Complexity of Some Two-Person Perfect-Information Games , 1978, J. Comput. Syst. Sci..

[7]  E. Berlekamp,et al.  Winning Ways for Your Mathematical Plays , 1983 .