Abstract
Klondike is the well-known 52-card Solitaire game available on almost every computer. The problem of determining whether an n-card Klondike initial configuration can lead to a win is shown NP-complete. The problem remains NP-complete when only three suits are allowed instead of the usual four. When only two suits of opposite color are available, the problem is shown NL-hard. When the only two suits have the same color, two restrictions are shown in AC0 and in NL respectively. When a single suit is allowed, the problem drops in complexity down to AC0[3], that is, the problem is solvable by a family of constant depth unbounded fan-in {and, or, mod 3}-circuits. Other cases are studied: for example, “no King” variant with an arbitrary number of suits of the same color and with an empty “pile” is NL-complete.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allender, E., Barrington, D., Chakraborty, T., Datta, S., Roy, S.: Grid Graph Reachability Problems. In: Proc. 21st Annual IEEE Conference on Computational Complexity, pp. 299–313 (2006)
Barrington, D., Immerman, N., Straubing, H.: On uniformity within NC 1. J. Computer and System Sciences 41(3), 274–306 (1990)
Buss, S., Cook, S., Gupta, A., Ramachandran, V.: An optimal parallel algorithm for formula evaluation. SIAM J. Computing 21, 755–780 (1992)
Helmert, M.: Complexity results for standard benchmark domains in planning. Artificial Intelligence 143(2), 219–262 (2003)
Gent, I., Jefferson, C., Lynce, I., Miguel, I., Nightingale, P., Smith, B., Tarim, A.: Search in the Patience Game “Black Hole”. In: AI Communications. pp. 1–15. IOS Press, Amsterdam, ISSN 0921-7126
Kaye, R.: Minesweeper is NP-complete. In: The Mathematical Intelligencer, vol. 22(2), pp. 9–15. Springer, Heidelberg (2000)
Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)
Parlett, D.: Solitaire: “Aces Up” and 399 Other Card Games, Pantheon (1979)
Parlett, D.: A History of Card Games. Oxford University Press, Oxford (1991)
Yan, X., Diaconis, P., Rusmevichientong, P., Van Roy, B.: Solitaire: Man versus Machine. In: Proc. Advances in Neural Information Processing Systems, NIPS, vol. 17 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Longpré, L., McKenzie, P. (2007). The Complexity of Solitaire. In: Kučera, L., Kučera, A. (eds) Mathematical Foundations of Computer Science 2007. MFCS 2007. Lecture Notes in Computer Science, vol 4708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74456-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-74456-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74455-9
Online ISBN: 978-3-540-74456-6
eBook Packages: Computer ScienceComputer Science (R0)