News for hackers. Stuff that matters.
Re:Oxford Undergrad CS Admission Interview Problems by JoachimSchipper on Friday January 14, 2011 @09:33AM (#2103562)
[SPOILER for 4 - "Monkey beans"]

The answer is not probabilistic (that is, the last bean is either white with 100% probability, or black with 100% probability). This took me a while to figure out.

Re:Oxford Undergrad CS Admission Interview Problems by hasha on Friday January 14, 2011 @11:18AM (#2104019)
I don't think so. After each drawing the number of whites is congruent modulo 2 to the initial number of whites. Hence, when there are two beans left, one will be white and the other black so the last bean will be white.
Re:Oxford Undergrad CS Admission Interview Problems by JoachimSchipper on Friday January 14, 2011 @11:21AM (#2104030)
That's the right answer, yes (you can even skip "Hence, when there...the other black"); but what do you mean by "I don't think so"?
Re:Oxford Undergrad CS Admission Interview Problems by djhworld on Friday January 14, 2011 @10:26AM (#2103789)
I'm confused at the first hurdle

What if the money picks out 2 white beans at the start?

"If they are the same he puts a black bean back in the urn"

Re:Oxford Undergrad CS Admission Interview Problems by jws on Friday January 14, 2011 @11:08AM (#2103981)
I think the sentence's grammar is awkward. That pile next to the monkey has both black and white beans in it.
Re:Oxford Undergrad CS Admission Interview Problems by djhworld on Friday January 14, 2011 @11:24AM (#2104041)
Ah I see, this is what confused me, there's no stipulation as to what beans are sitting next to him in a pile.
Re:Oxford Undergrad CS Admission Interview Problems by JoachimSchipper on Friday January 14, 2011 @11:23AM (#2104037)
The monkey randomly picks two beans from the urn, then puts one (from the pile) back. That is, if the monkey picks two white beans from the urn, he gets a black bean from a pile of beans next to him, and puts that black bean in the urn.