Solitaire clobber

DOI10.1016/J.TCS.2003.02.001zbMATH Open1066.91016OpenAlexW2911245797MaRDI QIDQ1884994FDOQ1884994

Erik D. Demaine, Rudolf Fleischer, Martin L. Demaine

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.02.001

Recommendations

• A survey of Solitaire Clobber
• New results about impartial solitaire clobber
• Solitaire Clobber played on Hamming graphs
• An introduction to clobber
• Solitaire clobber played on Cartesian product of graphs

zbMATH Keywords

NP-completenessAnnihilation gamesBoard gamesCombinatorial games

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Combinatorial games (91A46)

Cites Work

• Winning ways for your mathematical plays. Vol. 1.
• Hamilton Paths in Grid Graphs

Cited In (17)

• Solitaire Clobber on circulant graphs
• An introduction to clobber
• The solitaire clobber game and correducibility of graphs
• Title not available (Why is that?)
• Solitaire clobber played on Cartesian product of graphs
• Title not available (Why is that?)
• Solitaire clobber as an optimization problem on words
• Garden of Eden states in Austrian solitaire
• Title not available (Why is that?)
• New results about impartial solitaire clobber
• Peg solitaire on graphs -- a survey
• Optimal token allocation in solitaire knock'm down
• Title not available (Why is that?)
• Solitaire Clobber played on Hamming graphs
• Impartial solitaire clobber played on powers of paths
• Strong reducibility of powers of paths and powers of cycles on impartial solitaire clobber
• The solitaire clobber game and correducibility

This page was built for publication: Solitaire clobber

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