The 100 prisoners problem has relevance to the fields of computer science and data structures. The original problem was created to solve a particular problem in data structure substring searching, and solutions to the problem could be very useful for that field. Navin Goyal and Michael Saks looked at some additional variants of the original game (not the specific case where the number of boxes/slips is equal to the number of prisoners) but did not find an optimal strategy . Students who have learned about this problem (especially the aspects of it that have to do with developing different strategies) may be better prepared when they start learning about computer science and creating algorithms.
This game is interesting to look at for the secondary mathematics curriculum. It looks at simple probabilities in the form of calculating the chance for a single player to succeed by guessing at random. It looks at compound probabilities by looking at the probability that all the players succeed when guessing at random. It looks at combinatorics and permutations when looking at the possible distributions of numbers. It looks at the difference between independent and dependent events when comparing different guessing strategies. The concept of cycles isn't part of the typical secondary curriculum, but it's certainly an appropriate level of difficulty for students. Students who haven't taken integral calculus don't yet have the skills to find the limit as the number of prisoners increases to infinity, but they can calculate the probability for a certain finite number of cases and observe that the limit appears to approach about 30%.
Back to top