Ant on a Cube
An ant starts at one vertex of a cube and each second moves along a randomly chosen edge to an adjacent vertex. What is the expected number of moves to reach the vertex diagonally opposite its starting point?
Related problems & prerequisites
Worth solving first
- Coupon Collector 4.0/10
- Distinct Faces 4.0/10
- Waiting for Double Heads 4.0/10
Source: Classic random-walk-on-a-graph exercise from standard Markov chain texts. Statement written for AxiomIQ.