In a complete graph of order $n$, a moving point starts from a certain vertex and moves along the edges. At each vertex, the unpassed edges are selected with equal probability to continue the movement. What is the expectation of the number of passed edges until it stops its movement?
The moving point probably does not pass all the edges. It just needs to move into a vertex and cannot move out.