The algorithmics of solitaire-like games

DOI10.1007/978-3-642-13321-3_1MaRDI QIDQ3575261zbMATHOpenAlexFDO

Authors Wei Chen, João F. Ferreira, Roland C. Backhouse

Publication date 26 July 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1822/33752

zbMATH Keywords

invariantspolynomialsalgorithm derivationtiling problemssolitairegames on cyclotomic polynomialsnuclear penniesseven-trees-in-one

Mathematics Subject Classification ID

Combinatorial games (91A46) Probabilistic games; gambling (91A60)

Recommendations

• A fresh look at peg solitaire
• Solving triangular peg solitaire
• Large peg-army maneuvers
• scientific article; zbMATH DE number 5925087
• scientific article; zbMATH DE number 23707

Cited in

(10)

• BGSL: an imperative language for specification and refinement of backtracking programs
• The solitaire clobber game and correducibility
• The complexity of solitaire
• scientific article; zbMATH DE number 7302729 (Why is no real title available?)
• Tetris player: Strategy driven algorithm
• scientific article; zbMATH DE number 5925087 (Why is no real title available?)
• Emergence and refinement
• Optimal token allocation in solitaire knock'm down
• Solitaire Mancala Games and the Chinese Remainder Theorem
• New Problems in Port-and-Sweep Solitaire

This page was built for publication: The algorithmics of solitaire-like games

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