Skip to main content

Kayles on the Way to the Stars

  • Conference paper
Computers and Games (CG 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3846))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays, 2nd edn. A K Peters, Ltd., Wellesley (2001)

    MATH  Google Scholar 

  2. Bodlaender, H.L., Kratsch, D.: Kayles and Nimbers. J. Algorithms 43(1), 106–119 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Conway, J.H.: On Numbers and Games, 2nd edn. A K Peters, Ltd., Wellesley (2001)

    MATH  Google Scholar 

  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 

  6. Kano, M.: Edge-removing games of star type. Discrete Mathematics 151, 113–119 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  7. Schaefer, T.J.: On the complexity of some two-person perfect-information games. Journal of Computer and System Sciences 16, 185–225 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  8. Siegel, A.: Combinatorial Game Suite (2003), http://cgsuite.sourcefourge.net/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fleischer, R., Trippen, G. (2006). Kayles on the Way to the Stars. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds) Computers and Games. CG 2004. Lecture Notes in Computer Science, vol 3846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11674399_16

Download citation

  • DOI: https://doi.org/10.1007/11674399_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32488-1

  • Online ISBN: 978-3-540-32489-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics