Overview
Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the mathematical intricacies of the mousetrap game, a deceptively simple card game introduced by Arthur Cayley in the 1800s that reveals deep connections to permutation theory and combinatorics. Learn the basic rules of mousetrap where players attempt to match card positions with their face values, then delve into Cayley's original mathematical analysis of winning strategies and probability calculations. Examine the concept of winning "in order" and discover how to count specific types of permutations that lead to victory. Investigate the phenomenon of "second hits" in the game and understand how they affect gameplay outcomes. Study reformed permutations and their role in analyzing game states, then explore the variant called modular mousetrap which introduces additional mathematical complexity. Gain insight into why this seemingly elementary game continues to challenge mathematicians today, with many fundamental questions about optimal strategies and probability distributions remaining unsolved despite over a century of study.
Syllabus
0:00 The Game of Mousetrap
3:30 Cayley's Analysis
6:28 Winning in Order
8:58 Counting Permutations
15:51 The Second Hit
19:28 Reformed Permutations
22:54 Modular Mousetrap
27:51 Conclusion
Taught by
Wrath of Math