醉蚂蚁走立方体
Drunk Ant
题目详情
一只蚂蚁站在立方体某个顶点,只能沿棱边行走。它每次从当前顶点等概率选择一条棱走到相邻顶点。
问:到达对角顶点(相距最远的顶点)的期望走过棱边数是多少?
提示:把顶点按“离目标的距离层级”合并成若干等价状态。
An ant is standing on one corner of a cube & can only walk on the edges. The ant is drunk and from any corner, it moves randomly by choosing any edge! What is the expected number of edges the ant travels, to reach the opposite corner?
Hint
Try to find the equivalent vertices for the distance yet to travel. This should give equivalent merged vertices, with st being the start & the th being the destination.
解析
答案是 10。
把顶点分成 4 个等价状态:
- :起点
- :与起点相邻的 3 个点
- :与终点相邻的 3 个点
- :终点
设从状态 到达终点的期望步数为 ,写出递推方程并求解,可得 。
Original Explanation
Solution
We can define equivalent states, based on the corner the Ant is at:
- Starting corner.
- Corner adjacent to the starting corner.
- Corner that shares an edge with the opposite corner.
- The opposite corner.
We can represent the expected number of steps from each state as follows:
-
-
-
-
(already reached the destination)
Solving this we find
Calculations:
Substitute and in the middle equation.