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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Fleischer, R., & Trippen, G. (2006). Kayles on the way to the stars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3846 LNCS, pp. 232–245). https://doi.org/10.1007/11674399_16
Mendeley helps you to discover research relevant for your work.