clock_solitaire_simulation

clock_solitaire_simulation, a Python code which simulates the game of clock solitaire. The deck is dealt into 13 piles of 4 cards each. Repeatedly, the top card a pile is removed, and its rank indicates the next pile to consider. Game continues until an empty pile is reached. The game is won if all piles are empty. The quantity of interest is the probability of winning.

Knuth showed that the probability of winning is exactly 1/13.

Licensing:

The computer code and data files described and made available on this web page are distributed under the MIT license

Languages:

clock_solitaire_simulation is available in a MATLAB version and an Octave version and a Python version.

Related Data and codes:

clock_solitaire_simulation_test

python_simulation, a Python code which uses simulation to study card games, contests, and other processes which have a random element. Usually, the purpose is to try to predict the average behavior of the system over many trials.

Reference:

• Martin Gardner,
  Combinatorial problems involving tree graphs and forests of trees,
  Scientific American,
  February 1968.
• Donald Knuth,
  The Art of Computer Programming,
  Volume 1, Fundamental Algorithms,
  Third Edition,
  Addison-Wesley, 1997,
  ISBN: 0201896834,
  LC: QA76.6.K64.

Source Code:

• clock_solitaire_simulation.py, the source code.
• clock_solitaire_simulation.sh, runs all the tests.
• clock_solitaire_simulation.txt, the output file.