Can a Chess Piece Explain Markov Chains?

The video explores the problem of a knight's random movement on a chessboard, using Markov chains to determine the average number of moves it takes to return to its starting square. It introduces the concept of stationary distribution and applies a theorem to solve the problem. The video also discusses pi in different metrics, highlighting its variability and irrationality.

What is the best counter to the Queen's Gambit?

How many legal moves does a knight have from its starting position?

What is the probability of a knight jumping to a specific square when it has multiple options?

What is a Markov chain and what are its two main components?

What is the significance of the arrows in the probability transition function of a Markov chain?

What happens to the stationary distribution if the probability transmission function changes?

How does the stationary distribution relate to the time it takes for a knight to return to its original square?

What fraction of time does a knight spend on each square of the chessboard?

How many random hops does it take on average for a knight to return to its original square?

If a knight starts in the corner of the chessboard, how would that affect the average number of hops to return?