Clobber is a new two-player board game. In this paper, we introduce the one-player variant
Solitaire Clobber where the goal is to remove as many stones as possible from the board by …

… propose several open problems related to Solitaire Clobber. … Given a game position of Solitaire
Clobber on a graph G, we say that … ” Solitaire game, we are interested in Solitaire Clobber …

… We prove that the one-player game Solitaire Clobber 2 is equivalent to an optimization
problem on a set of words defined by seven classes of forbidden patterns when played on the …

… Solitaire Clobber defined by Demaine et al. in [2]. Note that both solitaire games come from
the two-player game Clobber, … One can have a look to [4] for more information about Clobber. …

… This enables to show that Solitaire Clobber is NP-hard. Solitaire Clobber was already studied
… We also address some extremal questions related to Solitaire Clobber in general graphs. …

… The version of the Solitaire Clobber game that we consider in this paper was introduced by
… and clobbering another one of different color located on an adjacent vertex; the clobbered …

… solitaire version that we are interested in was presented by Demaine et al. in 2004. Solitaire
Clobber … A move consists in picking up a stone and clobbering another one of opposite color …

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 …

… In order to reduce the Hamiltonian path to solitaire clobber, we consider ( G , Φ ) such that …
and, in particular, on grid graphs [7], solitaire clobber is NP-hard on such graphs. We note that …

… (ISC) is a variant of the two-player game Clobber introduced by Albert et al. in 2002. It is a
… clobbering another one of the opposite color located on an adjacent vertex. The clobbered …