Suppose that 3 white and 3 black balls are distributed in two urn in such a way that each urn contains 3 balls. We say that the system is in state i if the first urn contains i white balls, i = 0, 1, 2, 3. At each stage, 1 ball is drawn from each urn and the ball drawn from the first urn is placed in the second, and conversely with the ball from the second urn. Let Xn denote the state of the system after the nth stage, and compute the transition probabilities of the Markov chain {Xn, n ≥ 0}.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.