The Riddle That Seems Impossible Even If You Know The Answer

Value of the Information & Strength of the Argument

The video provides a clear and compelling explanation of a counterintuitive mathematical result. The argumentation is solid: it starts with the problem statement, introduces the loop strategy, and then rigorously derives the probability of success. The use of visualizations and step-by-step reasoning helps the viewer understand the underlying permutation structure. The video also addresses common misconceptions, such as the independence of individual probabilities, and explains why the strategy works by linking the prisoners’ outcomes. The value of the information is high, as it not only presents the solution but also explores extensions and the limit behavior, providing a deeper understanding of the mathematics involved.

Scientific Rigor, Source Quality, Title Accuracy

The video demonstrates high scientific rigor. It cites the original paper by Gál and Miltersen (2003), Winkler’s puzzle collection, and other academic references. The mathematical derivations are accurate and well-explained. The title accurately reflects the content: the riddle is indeed seemingly impossible even when the answer is known, and the video thoroughly explains the solution and its counterintuitive nature. The video also acknowledges the contributions of other mathematicians and educators, enhancing its credibility. The description includes links to the cited sources, allowing viewers to verify the information.

The title accurately reflects the content: the riddle is presented as seemingly impossible even after knowing the answer, and the video thoroughly explains the solution and its counterintuitive nature.

9/10

The video is well-researched, citing the original paper by Gál & Miltersen, Winkler's puzzle collection, and other academic sources. The mathematical derivations are clearly explained and cross-checked with experts. The presentation is rigorous and transparent about the assumptions.

Markers derived by PSI from the transcript: the creator did not define chapters.

• 00:00Introduction to the 100 prisoners riddle and its counterintuitive nature.
• 01:00Statement of the problem: 100 prisoners, 100 boxes, each must find their number in 50 attempts.
• 02:00Naive random strategy gives probability 1/2^100, essentially zero.
• 03:00Introduction of the loop strategy: start with your number's box and follow the numbers.
• 04:00Explanation of permutation cycles and why the strategy works.
• 05:00Key insight: success depends on the longest cycle length being at most 50.
• 06:00Calculation of the probability of no cycle longer than 50: 1 - (1/51 + ... + 1/100) ≈ 0.31.
• 07:00Discussion of individual vs. collective probability: each prisoner still has 50% chance, but outcomes are correlated.
• 08:00Addressing a common misconception about starting at the right box.
• 09:00Variation: a friendly warden can guarantee success by swapping two slips.
• 10:00Variation: a malicious warden can be countered by renumbering boxes.
• 11:00Extension to larger numbers of prisoners: success probability tends to 1 - ln(2) ≈ 30.7%.
• 12:00Conclusion: the strategy works by linking the prisoners' fates, making them all succeed or fail together.

• The Cell Probe Complexity of Succinct Data Structures — Original paper by Gál and Miltersen (2003) that introduced the 100 prisoners problem.
• Seven Puzzles You Think You Must Not Have Heard Correctly — Winkler's collection of puzzles, which includes the 100 prisoners problem.
• The 100 Prisoners Problem — Wikipedia article providing background and variations of the problem.
• On the Number of Permutations on n Objects with Greatest Cycle Length k — Academic paper by Golomb and Gaal (1998) on cycle length distributions.
• Puzzling Prisoners Presented to Promote North America's Only Museum of Math — Scientific American article by Evelyn Lamb discussing the problem.
• Permutations — Wikipedia article on permutations, relevant to the mathematical background.
• Probability that a random permutation of n elements has a cycle of length k greater than n/2 — Math Stack Exchange discussion on cycle length probabilities.
• Counting Cycle Structures in Sn — Math Stack Exchange discussion on counting cycle structures.
• What is the distribution of cycle lengths in derangements? In particular, expected longest cycle — Math Stack Exchange discussion on cycle length distributions.
• Manim - Mathematical Animation Framework — Software used for creating mathematical animations in the video.
• minutephysics video on the 100 prisoners problem — Another video covering the same riddle.
• Vsauce2 video on the 100 prisoners problem — Another video covering the same riddle.
• Stand-up Maths video on the 100 prisoners problem — Another video covering the same riddle.
• TED-Ed video on the 100 prisoners problem — Another video covering the same riddle.

• The 100 Prisoners Problem (Wikipedia) — Confirms the problem statement and the loop strategy solution.
• Gál, A., & Miltersen, P.B. (2003). The Cell Probe Complexity of Succinct Data Structures. — Original paper that introduced the problem.
• Winkler, P. (2006). Seven Puzzles You Think You Must Not Have Heard Correctly. — Includes the problem and its solution.

• Comment suggesting the strategy is not practical due to human factors — Some comments point out that in a real prison scenario, convincing 100 prisoners to follow the strategy is unlikely, but this does not contradict the mathematical validity of the solution.

• brilliant.org
• ve42.co
• ve42.co
• ve42.co
• ve42.co