Robots have been programmed to traverse the maze shown in Figure 3.28 and at each junction randomly choose which way to go.
(a) Construct the transition matrix for the Markov chain that models this situation.
(b) Suppose we start with 15 robots at each junction. Find the steady state distribution of robots. (Assume that it takes each robot the same amount of time to travel between two adjacent junctions.)
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.