Anonymous user
Talk:100 prisoners: Difference between revisions
→No card viewed en route to a find needs further checking: level of simulation.
(→No card viewed en route to a find needs further checking: level of simulation.) |
|||
Line 52:
All of this can be simplified: just compute the cycle decomposition of the initial permutation. If any cycle has length >50, bad luck, otherwise they all win. This can be done in O(n) where n is the length of the permutation. <br/>See also [https://en.wikipedia.org/wiki/Random_permutation_statistics#One_hundred_prisoners this]. [[User:Eoraptor|Eoraptor]] ([[User talk:Eoraptor|talk]]) 19:47, 7 November 2019 (UTC)
: Thanks - good reference. Perhaps one to add to the task description page. [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 20:00, 7 November 2019 (UTC)
Simulations need some judgement in how close one follows the actual, vs the need to ''demonstrate'' that the simulation is of the actual. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 23:32, 7 November 2019 (UTC)
| |||