The Complexity of Solitaire

DOI10.1007/978-3-540-74456-6_18zbMATH Open1147.68536OpenAlexW4206821144MaRDI QIDQ3525567FDOQ3525567

Authors: Luc Longpré, Pierre McKenzie 

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_18

Recommendations

• The complexity of solitaire
• Complexity of Scorpion solitaire and applications to Klondike
• UNO is hard, even for a single player
• Solitaire automata
• Strategy and Complexity of The Game of Squares

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)

Cited In (10)

• Lowering the Odds for "Even Up"
• Solitaire Mancala Games and the Chinese Remainder Theorem
• Domino Games and Complexity
• The complexity of solitaire
• Solitaire automata
• Optimal token allocation in solitaire knock'm down
• Complexity of Scorpion solitaire and applications to Klondike
• Computational complexity of puzzles and related topics
• The solitaire clobber game and correducibility
• UNO is hard, even for a single player

This page was built for publication: The Complexity of Solitaire

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