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.
KeywordsPolynomial Time Periodic Sequence Single Vertex Simple Path Center Vertex
Unable to display preview. Download preview PDF.
- 4.Fraenkel, A.S.: Recent results and questions in combinatorial game complexities. In: Expanded version of invited lecture at Ninth Australasian Workshop on Combinatorial Algorithms, Perth, Western Australia, July 27–30, pp. 124–146 (1998); Iliopoulos, C. (ed.): Proc. AWOCA 1998, pp. 124–146 (1998)Google Scholar
- 5.Guy, R.K., Smith, C.A.B.: The G-values of various games. In: Proc. Cambridge Philos. Soc., vol. 52, pp. 514–526 (1956)Google Scholar
- 8.Siegel, A.: Combinatorial Game Suite (2003), http://cgsuite.sourcefourge.net/