Home

# New results about impartial solitaire clobber

Abstract

Impartial Solitaire Clobber is a one-player version of the combinatorial game Clobber, introduced by Albert et al. in 2002. The initial configuration of Impartial Solitaire Clobber is a graph, such that there is a stone placed on each of its vertex, each stone being black or white. A move of the game consists in picking a stone, and clobbering an adjacent stone of the opposite color. By clobbering we mean that the clobbered stone is removed from the graph, and replaced by the clobbering one. The aim is to make a sequence of moves leaving the minimum number of stones on the graph; this number is called the reducibility value of the configuration. As any one-player game, Solitaire Clobber is essentially an optimization problem, whose resolution may give bounds on the two-player version of the game. As an optimization problem, Solitaire Clobber can be considered as a constrained version of the underlying optimization problem related to Hamiltonian path. This enables to show that Solitaire Clobber is NP-hard. Solitaire Clobber was already studied in various graph structures, including paths, cycles, trees, and Hamming graphs. In this paper we investigate the problem in complete multipartite graphs. In particular, we give a linear-time algorithm computing the reducibility value of any configuration in complete multipartite graphs. We also address some extremal questions related to Solitaire Clobber in general graphs.

References
Hide All
[1] M.H. Albert, J.P. Grossman, R.J. Nowakowski and D. Wolfe, An introduction to Clobber. INTEGERS 5 (2005).
[2] L. Beaudou, E. Duchêne and S. Gravier, A survey about Solitaire Clobber (submitted).
[3] V.D. Blondel, C. de Kerchove, J.M. Hendrickx and R. Jungers, Solitaire Clobber as an optimization problem on words. INTEGERS 7 (2008).
[4] B. Bollobás, Random graphs. Cambridge University Press (2001).
[5] Demaine, E.D., Demaine, M.L. and Fleischer, R., Solitaire Clobber. Theor. Comput. Sci. 313 (2004) 325338.
[6] P. Dorbec, E. Duchêne and S. Gravier, Solitaire Clobber played on Hamming graphs. Integers, J. Comb. No. Theory 7 (2008).
[7] Itai, A., Papadimitriou, C.H. and Szwarcfiter, J.L., Hamilton paths in grid graphs. SIAM J. Comput. 11 (1982) 676686.
[8] I. Peterson, Getting clobbered, Science News 161 (2002), http://www.sciencenews.org/articles/20020427/mathtrek.asp.
[9] M. Ruszinkó, private communication.
Recommend this journal

RAIRO - Operations Research
• ISSN: 0399-0559
• EISSN: 1290-3868
• URL: /core/journals/rairo-operations-research
Who would you like to send this to? *

×

## Full text viewsFull text views reflects the number of PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 0 *

## Abstract viewsAbstract views reflect the number of visits to the article landing page.

Total abstract views: 0 *

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed