Question : Let X(adsbygoogle = window.adsbygoogle || []).push({}); _{n }be the maximum score obtained after n throws of a fair dice

a) Prove that Xn is a markov chain and write down the transition matrix

Im having a problem starting the transition matrix

im assuming the states are meant to be the sum. then do you write out the transition matrix for the first 2 throws and have this matrix to the power of n-1?

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Markov chain, sum of N dice rolls

Loading...

Similar Threads for Markov chain dice |
---|

I A seemingly simple problem about probability |

I Probability of a Stochastic Markov process |

B Simultaneous roll of Non Transitive Dice |

A Markov Chain as a function of dimensions |

**Physics Forums | Science Articles, Homework Help, Discussion**