t********y
发帖数: 166 | 1 大牛们帮忙看看这道题？
我连题目都没读懂........
You have to walk from point A to point B 10 times, blindfolded. Every time
before you start walking, a fair coin is tossed, and if it comes out heads,
a wall in the middle is present (situation 2 in the picture), while if it
comes out tails it is not (situation 1 in the picture). As you are
blindfolded, you do not know if the wall is present or not.
Even though you are blindfolded, you can move in perfectly straight lines
towards any point you choose. Can you give a prescription how to walk from A
to B so that the total distance you cover is as small as possible? What
distance do you expect to cover in those 10 walks?
难道是走1m到中间等着有墙就再投一次？...这也太傻了吧...还是我太傻了。 | i**e
发帖数: 604 | | t********y
发帖数: 166 | 3 谢谢。我也觉得是平面图。
但是题目默认每一次都要一次走完，不能在中间再掷一次硬币，是么？
途中遇墙那个点怎么选取呢？根据路线的期望最小值解出长度么？
【在 i**e 的大作中提到】
: 我猜是平面图。。。估计这个把你弄糊涂了
| i******t
发帖数: 370 | 4 Aim at the point with a distance of sqrt(2)/4 to the root of the wall? | c******t
发帖数: 133 | 5 +1
【在 i******t 的大作中提到】
: Aim at the point with a distance of sqrt(2)/4 to the root of the wall?
|
|
