Re:How to leave academia (for science PhDs)
by lgieron on Thursday April 05, 2012 @02:33PM
(#3803900)
Minor comment from a Scala fan - on that last line you could have used:
happyLast.count(_ == true)
instead of:
happyLast.filter(x=>x).size
Re:How to leave academia (for science PhDs)
by graphene on Thursday April 05, 2012 @02:48PM
(#3803978)
shouldn't that be {123, 213, 312, 321}?
ie 231 is not possible since after 1 randomly decides to sit at 3, 2 has no reason to go sit in seat 1.
This doesn't change the answer to the problem though I think.
Re:How to leave academia (for science PhDs)
by dxbydt on Thursday April 05, 2012 @03:26PM
(#3804174)
uh, nope.
xyz => 1 sits on seat x, 2 on seat y, 3 on seat z
So the only possibilities are:
123: 1 sits on seat 1, 2 on seat 2, 3 on seat 3
213: 1 sits on seat 2, 2 on seat 1, 3 on seat 3
231: 1 sits on seat 2, 2 on seat 3, 3 on seat 1
321: 1 sits on seat 3, 2 on seat 2, 3 on seat 1
passenger 3 is happy twice out of 4, hence 50%
In the code, the happyLast variable counts the number of times the last passenger is happy ( happy == when he gets his assigned seat)
For 3 passengers the seating possibilities are {123,213,231,321}, so 3 gets to sit on seat 3 50% of the time.
For 4 passengers the seating possibilities are {1234,2134,2314,2341,2431,3241,3214,4231}, so 4 gets to sit on seat 4 50% of the time. From there you can do a proof by induction.
If you like code: ----
----- >scala -cp classes passengers 100 100000 >0.4997