This video forms part one of a two part video series introducing absorbing Markov Chains and how to deal with them, both with recursion techniques and via transition matrices. In this first video we introduce the concept of absorbing states via a game where a brave knight has to try and rescue a princess and live happily ever after (absorbing state P) before being eaten by a dragon (absorbing state D). We show how to calculate his probability of success given various scenarios.
The second video, entitled 'Absorbing Markov Chains Solved with Transition and Solution Matrices' can be found at https://www.youtube.com/watch?v=WxCBILZt_0U
For more videos on Markov chains see our playlist 'Markov Chains' at https://www.youtube.com/playlist?list=PLlX3COjsHPVDkTC3MENgdITlfCnKy3fxK
For more videos on recursion, see our playlist 'Recursion' at https://www.youtube.com/playlist?list=PLlX3COjsHPVAeUZl28mNyKsuBlBslHPm6
For more videos on GRE Subject Maths see our playlist 'GRE Subject Maths' at
https://www.youtube.com/playlist?list=PLlX3COjsHPVCpFemZUNEy1tsNK4LlxG-S
For more undergraduate maths videos see our playlist 'Undergraduate Maths' at https://www.youtube.com/playlist?list=PLlX3COjsHPVBBBUylne5vYT9Q_02-eB8c
