相关论文: The Bulgarian solitaire and the mathematics around…
We consider a stochastic version of Bulgarian solitaire: A number of cards are distributed in piles; in every round a new pile is formed by cards from the old piles, and each card is picked independently with a fixed probability. This game…
Bulgarian solitaire is played on $n$ cards divided into several piles; a move consists of picking one card from each pile to form a new pile. In a recent generalization, $\sigma$-Bulgarian solitaire, the number of cards you pick from a pile…
We consider a stochastic variant of the game of Bulgarian solitaire [M. Gardner (1983), Sci. Amer. 249, 12-21]. For the stationary measure of the random Bulgarian solitaire, we prove that most of its mass is concentrated on (roughly)…
The Bulgarian Solitaire rule induces a finite dynamical system on the set of integer partitions of $n$. Brandt characterized and counted all cycles in its recurrent set for any given $n$, with orbits parametrized by necklaces of black and…
Bulgarian Solitaire is an interesting self-map on the set of integer partitions of a fixed number $n$. As a finite dynamical system, its long-term behavior is well-understood, having recurrent orbits parametrized by necklaces of beads with…
We introduce \emph{$p_n$-random $q_n$-proportion Bulgarian solitaire} ($0<p_n,q_n\le 1$), played on $n$ cards distributed in piles. In each pile, a number of cards equal to the proportion $q_n$ of the pile size rounded upward to the nearest…
Austrian Solitaire is a variation of Bulgarian Solitaire. It may be described as a card game, a method of asset inventory management, or a discrete dynamical system on integer partitions. We prove that the limit cycles in Austrian Solitaire…
Triangular peg solitaire is a well-known one-person game or puzzle. When one peg captures many pegs consecutively, this is called a sweep. We investigate whether the game can end in a dramatic fashion, with one peg sweeping all remaining…
We consider the one-person game of peg solitaire on a triangular board of arbitrary size. The basic game begins from a full board with one peg missing and finishes with one peg at a specified board location. We develop necessary and…
"Solitaire Chess" is a logic puzzle published by Thinkfun, that can be seen as a single person version of traditional chess. Given a chess board with some chess pieces of the same color placed on it, the task is to capture all pieces but…
We introduce a one-person game that we call Padlock Solitaire which resembles the well-known clock solitaire card game. Analyzing variants of this game we obtain simple proofs of some classical results of combinatorics including ballot…
We consider the one-person game of peg solitaire played on a computer. Two popular board shapes are the 33-hole cross-shaped board, and the 15-hole triangle board---we use them as examples throughout. The basic game begins from a full board…
Clobber is a new two-player board game. In this paper, we introduce the one-player variant Solitaire Clobber where the goal is to remove as many stones as possible from the board by alternating white and black moves. We show that a…
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…
Peg solitaire is an old puzzle with a 300 year history. We consider two ways a computer can be utilized to find interesting peg solitaire puzzles. It is common for a peg solitaire puzzle to begin from a symmetric board position, we have…
We present the first formal mathematical presentation of the generalized Russian cards problem, and provide rigorous security definitions that capture both basic and extended versions of weak and perfect security notions. In the generalized…
In this article we give an exposition of Toom's proof of Bulgarian Solitaire that appeared in \emph{Kvant}. We provide more details. We also show how an application of the Chinese Remainder Theorem allows us to generalize the proof.
We introduce a very simple solitaire game, named Stanley Solitaire, in honor of Richard Stanley, and prove an explicit closed-form formula for the number of ways of playing it. Alas, the only proof that we know is via a deep theorem of…
A chain is an ordering of the integers 1 to n such that adjacent pairs have sums of a particular form, such as squares, cubes, triangular numbers, pentagonal numbers, or Fibonacci numbers. For example 4 1 2 3 5 form a Fibonacci chain while…
The solitaire of independence is a groupoid action resembling the classical 15-puzzle, which gives information about independent sets of coordinates in a totally extremally permutive subshift. We study the solitaire with the triangle shape,…