College Mathematics: Learning Worksheets Chapter 15
Name ________________________________ Date ______________ Class ____________
Goal: To solve application problems using Markov chains
1. A computer game has two levels. Level one is called Flying Low and level two is called
Flying High. To win the game the player must successfully complete Flying Low before
getting to Flying High. On their first attempt at playing the game, 30% of players are able to
successfully navigate Flying Low and move on to Flying High, 50% make an error and are
eliminated from the game, and the rest continue to play at the Flying Low level. After
making it to Flying High, 10% of the players successfully navigate Flying High and win the
game, 15% make a fatal error and are eliminated from the game, and the rest continue to play
at the Flying High level.
a) Draw a transition diagram.
0.3
FLYING FLYING
0.5 0.15 0.1
1
Section 15-3 Absorbing Markov Chains
The limiting matrix: 0
0
I
PFR
where
1
FIQ
(F is called the fundamental matrix for P).