The algorithmics of solitaire-like games

DOI10.1007/978-3-642-13321-3_1zbMATH Open1286.91036OpenAlexW3023169038MaRDI QIDQ3575261FDOQ3575261

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (10)

• Emergence and refinement
• Tetris player: Strategy driven algorithm
• Solitaire Mancala Games and the Chinese Remainder Theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• New Problems in Port-and-Sweep Solitaire
• The complexity of solitaire
• Optimal token allocation in solitaire knock'm down
• The solitaire clobber game and correducibility
• BGSL: an imperative language for specification and refinement of backtracking programs

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)