• Corpus ID: 207881112

The Winnability of Klondike Solitaire and Many Other Patience Games

@article{Blake2019TheWO,
  title={The Winnability of Klondike Solitaire and Many Other Patience Games},
  author={Charlie Blake and Ian P. Gent},
  journal={arXiv: Artificial Intelligence},
  year={2019}
}
Our ignorance of the winnability percentage of the game in the Windows Solitaire program, more properly called 'Klondike', has been described as "one of the embarrassments of applied mathematics". Klondike 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… 

Tables from this paper

References

SHOWING 1-10 OF 63 REFERENCES

Searching with Analysis of Dependencies in a Solitaire Card Game

This work presents a new method for taking advantage of the relative independence between parts of a single-player game called Gaps, and describes precisely how to detect interactions between sequences and how to deal with them.

Searching Solitaire in Real Time

A multistage nested rollout algorithm that allows the user to apply separate heuristics at each stage of the search process and tune the search magnitude for each stage and proposes a searchtree compression that reveals a new state representation for Klondike Solitaire and Thoughtful Solitaire.

Card games as pointer structures: case studies in mobile CSP modelling

The techniques developed for some of these card games -which employ various dynamic patterns of cards - suggest techniques for modelling pointer structures in CSP and FDR analogous to those used with the pi-calculus.

Automatically Generating Streamlined Constraint Models with Essence and Conjure

Good models can be identified for problems in combinatorial design, Ramsey theory, graph theory and group theory - often resulting in order of magnitude speed-ups.

Symmetry in Constraint Programming

Approximate is Better than “Exact” for Interval Estimation of Binomial Proportions

Abstract For interval estimation of a proportion, coverage probabilities tend to be too large for “exact” confidence intervals based on inverting the binomial test and too small for the interval

A programming and problem solving seminar.

This report contains transcripts of the classroom discussions of Stanford''s Computer Science problem solving course for Ph.D. students, CS304, during Winter quarter 1990, and the first CS204 class

Caching Search States in Permutation Problems

Caching states visited has proved effective in reducing both search effort and run-time for difficult instances of each class, and the space requirements are manageable.

Streamlined Constraint Reasoning

We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search first towards a small and

Man versus the machine.

...