.@propensive shared an interesting problem yesterday, and I thought it might be a fun exercise to code up a simulation of it in scala. Check it out:https://github.com/zakpatterson/nprisonerproblem …
Show this thread
-
It's in the readme! Here it is for 1 million trials: bestStrategy: Lived 312304 times (31.230%)
-
-
Do you think there's any other (legal) strategy that could even break a 1 in a billion chance of survival? That's the part that seems most interesting to me. There may only be one legal strategy between 0.5^50 or so and 0.31
-
Ignoring I suppose just intentionally failing, for example follow the cycle strategy but give up early.
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.