How many moves does it take, on average, for a knight to move back to its original position in chess? Scholars learn how a Markov chain with state space and probability transition function helps solve this problem. After finding the stationary distribution, the video displays the process to find that it takes an average of 112 moves.

Concepts

chess, probability

Show More Show Less

Additional Tags

math

Show More Show Less

Instructional Ideas

• Pause the video when indicated to have the class come up with their own answers
• Bring in an actual chess board for pupils to reference

Classroom Considerations

• It is useful if learners have a basic understanding of chess pieces and how they move, but it is not necessary

• This video is hosted on YouTube

Pros

• Provides list of resources in the description
• Graphics help understanding

Cons

• None