Bulgarian solitaire

From HandWiki
Short description: Card game

In mathematics and game theory, Bulgarian solitaire is a card game that was introduced by Martin Gardner.[1]

Rules

In the game, a pack of N cards is divided into several piles. Then for each pile, remove one card; collect the removed cards together to form a new pile (piles of zero size are ignored).

If N is a triangular number (that is, N=1+2++k for some k), then it is known that Bulgarian solitaire will reach a stable configuration in which the sizes of the piles are 1,2,,k. This state is reached in k2k moves or fewer. If N is not triangular, no stable configuration exists and a limit cycle is reached.

Random Bulgarian solitaire

In random Bulgarian solitaire or stochastic Bulgarian solitaire a pack of N cards is divided into several piles. Then for each pile, either leave it intact or, with a fixed probability p, remove one card; collect the removed cards together to form a new pile (piles of zero size are ignored). This is a finite irreducible Markov chain.

History

Martin Gardner introduced the game in the August 1983 issue of Scientific American.[1]

In 2004, Brazilian probabilist Serguei Popov demonstrated that stochastic Bulgarian solitaire spends "most" of its time in a "roughly" triangular distribution.[2]

See also

References

  1. 1.0 1.1 Akin, Ethan; Davis, Morton (April 1985). "Bulgarian Solitaire". The American Mathematical Monthly 92 (4): 237–250. doi:10.2307/2323643. https://www.jstor.org/stable/2323643. 
  2. Popov, Serguei (October 2005). "Random Bulgarian solitaire" (in en). Random Structures and Algorithms 27 (3): 310–330. doi:10.1002/rsa.20076. ISSN 1042-9832. https://onlinelibrary.wiley.com/doi/10.1002/rsa.20076.