Question

4. Consider a game of ladder climbing. There are 5 levels in the game, level 1 is the lowest (bottom) and level 5 is the highest (top). A player starts at the bottom. Each time, a fair coin is tossed. If it turns up heads, the player moves up one level. If tails, the player moves down to the very bottom. Once at the top level, the player moves to the very bottom if a tail turns up, and stays at the top if head turns up. Model this game as a Markov chain. What is the player's expected level after two games?

Answer 1

IF WEMOOEL THIS AME AS A MARKOV CHAN 1he 1rantition probablihy Maliz 1e levels t, 2,3, 4, S he mati in the gane transitron levels be the tes the numbened westion Cordtions in the to the mahi Gripro Next level 4.5 2 0-5 0.5 1 0.5 Pretent lwel 0-5 2 O-5 0 23 0-5 4 0.5 O 0.5 0.5 bottom leve | Intaty is playes ve tnihal games Pl2)- pelo) atco hng Kolog mov Espeided level alten 2 (This chapman the oriem) to 0-25 0 25 .5 p: (atten calculations O25 0.25 0.5 0.5 0.25 O.25 0 25 0.25 O-25 0.5 0.25

pl2 PP) J O.S O.25 0.2S 0 O 0 00 0 11 0.25 O25 O 0-25 0-25 0 0-5 O-5 O.25 0-25 0 S O.25 C.25 0.25 0.25 allon 2 games eApeted prokablty Ths is the BASED ON AU Calculatons done here ane ANO MATRIX MARKOV CHAIN PROPERTIES MUL1I PLILA1LON abe Knowledge ot markov chain is Teauaed tor