Solitaire clobber as an optimization problem on words

MaRDI QIDQ3629025zbMATH OpenFDO

Authors Vincent D. Blondel, Julien M. Hendrickx, Raphaël M. Jungers

Publication date 26 May 2009

Full work available at URL https://eudml.org/doc/117411, http://www.emis.de/journals/INTEGERS/papers/ig4/ig4.Abstract.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Applications of mathematical programming (90C90) Combinatorial games (91A46)

Recommendations

• Solitaire clobber
• A survey of Solitaire Clobber
• New results about impartial solitaire clobber
• Solitaire Clobber played on Hamming graphs
• Solitaire Clobber on circulant graphs

Cited in

(6)

• Solitaire Clobber on circulant graphs
• The solitaire clobber game and correducibility of graphs
• Solitaire clobber played on Cartesian product of graphs
• Impartial solitaire clobber played on powers of paths
• Strong reducibility of powers of paths and powers of cycles on impartial solitaire clobber
• New results about impartial solitaire clobber

This page was built for publication: Solitaire clobber as an optimization problem on words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629025)