HackerPapers

arXiv:1906.12314cs.AI

The Winnability of Klondike Solitaire and Many Other Patience Games

Charlie Blake, Ian P. Gent

Abstract

Our ignorance of the winnability percentage of the solitaire card game `Klondike' has been described as ``one of the embarrassments of applied mathematics''. Klondike, the game in the Windows Solitaire program, is just one of many single-player card games, generically called `patience' or `solitaire' games, for which players have long wanted to know how likely a particular game is to be winnable. A number of different games have been studied empirically in the academic literature and by non-academic enthusiasts. Here we show that a single general purpose Artificial Intelligence program named `Solvitaire' can be used to determine the winnability percentage of 73 variants of 35 different single-player card games with a 95% confidence interval of $\pm$ 0.1% or better. For example, we report the winnability of Klondike as 81.945% $\pm$ 0.084% (in the `thoughtful' variant where the player knows the rank and suit of all cards), a 30-fold reduction in confidence interval over the best previous result. The vast majority of our results are either entirely new or represent significant improvements on previous knowledge. Solvitaire uses depth-first search and exploits a number of AI techniques including transposition tables, symmetry breaking, dominances, and streamliners. We give the first correctness proofs of two key dominances for patience games.

arXiv comments
Published version, please cite the JAIR version published in Feb 2026, doi 10.1613/jair.1.17167
Journal reference
Journal of ArtificialIntelligence Research, Volume 85, Article 21 (February 2026), 47 pages
DOI
doi:10.1613/jair.1.17167
Subjects
cs.AIArtificial Intelligence

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from Dec 2024 to Jan 2025. Found in 3 HN submissions from Jul 2019 to Feb 2025. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments2 threads

    • > While playing solitaire to while away the time during rest, Ulam asked himself a straightforward question: what are the chances that a hand laid out with 52 cards will come out successfully? It is a deceptively challenging problem—there are around 8 × 10^67 ways to sort a deck…

      palsecamView on HNParent context

  1. How God Plays Chess (2018) 1 comment
    • Some progress has been made on Solitaire here, although I understand it's still not fully peer-reviewed (I think) https://arxiv.org/pdf/1906.12314v3

      sourcepluckView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.