Can a Chess Piece Explain Markov Chains?

Can a Chess Piece Explain Markov Chains? | Infinite Series

2017-01-12

[public] 173K views, 6.01K likes, 63.0 dislikes audio only

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

/youtube/video/ineO1tIyPfM

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-Cambridge-Statistical-Probabilistic-Mathematics/dp/0521765390

Markov Chains

https://www.amazon.com/Markov-Cambridge-Statistical-Probabilistic-Mathematics/dp/0521633966

Markov Chains and Mixing Times

http://pages.uoregon.edu/dlevin/MARKOV/markovmixing.pdf

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: