Skip to main content

Solitaire Clobber

  • Conference paper
Book cover Computers and Games (CG 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2883))

Included in the following conference series:

  • 682 Accesses

Abstract

Clobber is a new two-player board game. In this paper, we introduce the 1-player variant Solitaire Clobber where the goal is to remove as many stones as possible from the board by alternating white and black moves. We show that a n stone checkerboard configuration on a single row (or single column) can be reduced to about n/4 stones. For boards with at least two rows and columns, we show that a checkerboard configuration can be reduced to a single stone if and only if the number of stones is not a multiple of three, and otherwise it can be reduced to two stones. But in general it is NP-complete to decide whether an arbitrary Clobber configuration can be reduced to a single stone.

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. Wolfe, D.: Clobber research (2002), http://www.gac.edu/~wolfe/games/clobber

  2. Demaine, E., Fleischer, R., Fraenkel, A., Nowakowski, R.: Seminar no. 02081. Technical Report 334, Dagstuhl Seminar on Algorithmic Combinatorial Game Theory (2002)

    Google Scholar 

  3. 34th International Mathematical Olympiad: Question 3 (1993), http://www.kalva.demon.co.uk/imo/imo93.html

  4. Grossman, J.: Private communication (2002)

    Google Scholar 

  5. Itai, A., Papadimitriou, C., Szwarcfiter, J.: Hamilton paths in grid graphs. SIAM Journal on Computing 11, 676–686 (1982)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Demaine, E.D., Demaine, M.L., Fleischer, R. (2003). Solitaire Clobber. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds) Computers and Games. CG 2002. Lecture Notes in Computer Science, vol 2883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40031-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-40031-8_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20545-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics