Hostname: page-component-77c89778f8-9q27g Total loading time: 0 Render date: 2024-07-18T17:59:38.765Z Has data issue: false hasContentIssue false

New results about impartial solitaire clobber

Published online by Cambridge University Press:  08 October 2009

Eric Duchêne
Affiliation:
ATER, IUFM de Grenoble, France; educhene1@yahoo.fr educhene@bat710.univ-lyon1.fr
Sylvain Gravier
Affiliation:
CNRS, France; sylvain.gravier@ujf-grenoble.fr
Julien Moncel
Affiliation:
Laboratoire G-SCOP, Grenoble, France; julien.moncel@g-scop.inpg.fr
Get access

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.

Type
Research Article
Copyright
© EDP Sciences, ROADEF, SMAI, 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

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