Can a Chess Piece Explain Markov Chains? | Infinite Series

Viewers like you help make PBS (Thank you 😃) . Support your local PBS Member Station here: https://to.pbs.org/donateinfi

In this episode probability mathematics and chess collide. What is the average number of steps it would take before a randomly moving knight returned to its starting square?

Tweet at us! @pbsinfinite
Facebook: facebook.com/pbsinfinite series
Email us! pbsinfiniteseries [at] gmail [dot] com

Previous Episode - When Pi is Not 3.14
   • When Pi is Not 3.14 | Infinite Series...  

Mathematician Kelsey Houston-Edwards explains Markov Chains and how they can be used to determine the probability of random chess moves, as well as the likelihood your favorite music will pop up on the radio.

Sources include:

Probability: Theory and Examples
https://www.amazon.com/Probability-Ca...

Markov Chains
https://www.amazon.com/Markov-Cambrid...

Markov Chains and Mixing Times
http://pages.uoregon.edu/dlevin/MARKO...

Written and Hosted by Kelsey Houston-Edwards
Produced by Rusty Ward
Graphics by Ray Lux
Made by Kornhaber Brown (www.kornhaberbrown.com)

Comments answered by Kelsey:

Taylor Kinser
   • When Pi is Not 3.14 | Infinite Series...  

Huy Dinh
   • When Pi is Not 3.14 | Infinite Series...  

Funky Tom
   • When Pi is Not 3.14 | Infinite Series...  

Steve’s Mathy Stuff
   • When Pi is Not 3.14 | Infinite Series...