回複：Quant 麵試題:梯子

來源: botong 於 2009-07-16 11:52:59 [] [博客] [舊帖] [給我悄悄話] 閱讀數 : (327 bytes)
本帖於 2009-07-17 17:21:51 時間, 由普通用戶 康MM 編輯

Coin A: has 2 faces - face-up and face-down
Coin B: has 2 faces - face-down only

Simple strategy would be: if you get coin A, then keep it.
If you get coin B, then change to coin A. This means dump coin B whenever possible. The probability is same at each step. So the prob would be the multiplication of each one.

請您先登陸，再發跟帖！