This thesis deals with processes on integer partitions and their limit shapes, with focus on deterministic and stochastic variants on one such process called *Bulgarian solitaire*. The main scientific contributions are the following.

**Paper I:** Bulgarian solitaire is a dynamical system on integer partitions of *n* which converges to a unique fixed point if *n*=1+2+...+*k* is a triangular number. There are few results about the structure of the game tree, but when *k* tends to infinity the game tree itself converges to a structure that we are able to analyze. Its level sizes turns out to be a bisection of the Fibonacci numbers. The leaves in this tree structure are enumerated using Fibonacci numbers as well. We also demonstrate to which extent these results apply to the case when *k* is finite.

**Paper II:** 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, *σ*-Bulgarian solitaire, the number of cards you pick from a pile is some function *σ* of the pile size, such that you pick *σ*(*h*) < *h* cards from a pile of size *h*. Here we consider a special class of such functions. Let us call *σ* well-behaved if *σ*(1) = 1 and if both *σ*(*h*) and *h − **σ*(*h*) are non-decreasing functions of *h*. Well-behaved *σ*-Bulgarian solitaire has a geometric interpretation in terms of layers at certain levels being picked in each move. It also satisfies that if a stable configuration of *n* cards exists it is unique. Moreover, if piles are sorted in order of decreasing size then a configuration is convex if and only if it is a stable configuration of some well-behaved *σ*-Bulgarian solitaire. If sorted configurations are represented by Young diagrams and scaled down to have unit height and unit area, the stable configurations corresponding to an infinite sequence of well-behaved functions (*σ*_{1}, *σ*_{2}, ...) may tend to a limit shape *Φ*. We show that every convex *Φ* with certain properties can arise as the limit shape of some sequence of well-behaved *σ*_{n}. For the special case when *σ*_{n}(*h*) = ceil(*q*_{n}h) for 0 < *q*_{n }≤ 1 (where ceil is the ceiling function rounding upward to the nearest integer), these limit shapes are triangular (in case *q*_{n}^{2}*n* → 0), or exponential (in case *q*_{n}^{2}*n* → ∞), or interpolating between these shapes (in case *q*_{n}^{2}*n* → *C* > 0).

**Paper III:** We introduce *p*_{n}-random q_{n}-proportion Bulgarian solitaire (0 < *p*_{n},*q*_{n} ≤ 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 integer are candidates to be picked. Each candidate card is picked with probability *p*_{n}, independently of other candidate cards. This generalizes Popov's random Bulgarian solitaire, in which there is a single candidate card in each pile. Popov showed that a triangular limit shape is obtained for a fixed *p* as *n* tends to infinity. Here we let both *p*_{n} and *q*_{n} vary with *n*. We show that under the conditions *q*_{n}^{2}*p*_{n}*n*/log *n* → ∞ and *p*_{n}q_{n} → 0 as *n* → ∞, the *p*_{n}-random *q*_{n}-proportion Bulgarian solitaire has an exponential limit shape.

**Paper IV:** We consider two types of discrete-time Markov chains where the state space is a graded poset and the transitions are taken along the covering relations in the poset. The first type of Markov chain goes only in one direction, either up or down in the poset (an *up chain* or *down chain*). The second type toggles between two adjacent rank levels (an *up-and-down chain*). We introduce two compatibility concepts between the up-directed transition probabilities (an *up rule*) and the down-directed (a *down rule*), and we relate these to compatibility between up-and-down chains. This framework is used to prove a conjecture about a limit shape for a process on Young's lattice. Finally, we settle the questions whether the reverse of an up chain is a down chain for some down rule and whether there exists an up or down chain at all if the rank function is not bounded.