Article

Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber.

Electronic Notes in Discrete Mathematics 01/2011; 37:177-182. DOI: 10.1016/j.endm.2011.05.031
Source: DBLP

ABSTRACT We consider the Impartial Solitaire Clobber which is a one-player combinatorial game on graphs. The problem of determining the minimum number of remaining stones after a sequence of moves was proved to be NP-hard for graphs in general and, in particular, for grid graphs. This problem was studied for paths, cycles and trees, and it was proved that, for any arrangement of stones, this number can be computed in polinomial time. We study a more complex question related to determining the color and the location of the remaining stones. A graph G is strongly 1-reducible if: for any vertex v of G, for any arrangement of stones on G such that G\v is non-monochromatic, and for any color c, there exists a succession of moves that yields a single stone of color c on v. We investigate this problem for powers of paths Pnr and for powers of cycles Cnr and we prove that if r⩾3, then Pnr (resp. Cnr) is strongly 1-reducible; if r=2, then Pnr, is not strongly 1-reducible.

0 Bookmarks
 · 
36 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Clobber is an all-small game usually played on a checkerboard but the rules easily generalize to play on an arbitrary graph. We show that, on a graph, determining the value of the game is NP-hard. We also examine clobber on a 1 × n and a 2 × n strip.
    Integers 08/2005; 5(2).
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The one-player game Solitaire Clobber was introduced by Demaine et al. Beaudou et al. considered a variation called SC2. Black and white stones are located on the vertices of a given graph. A move consists in picking a stone to replace an adjacent stone of the opposite color. The objective is to minimize the number of remaining stones. The game is interesting if there is at least one stone of each color. In this paper, we investigate the case of Hamming graphs. We prove that game configurations on such graphs can always be reduced to a single stone, except for hypercubes. Nevertheless, hypercubes can be reduced to two stones.
    01/2008;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: 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 line or on the cycle. This enables us to show that this game is solvable in linear time. Using this word representation, we also prove that, playing on the cycle, it is always possible to remove at least 2n/3 pawns, and we give a configuration for which it is not possible to do better, answering questions recently raised by Duchêne et al.
    INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY. 01/2008; 8.

Full-text (2 Sources)

View
6 Downloads
Available from
Jun 5, 2014