A bug starts on one vertex of a cube. Every second he randomly walks along one edge to another vertex. What is the expected value of the number of seconds it will take for him to reach the vertex opposite to the original vertex he was on?
Clarification : Every second he chooses randomly between the three edges available to him, including the one he might have just walked along.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The solution is given by this set of linear equations:
Where E is the expectation value. E 1 is the expectation value from a vertex neighboring the original vertex. E 2 is the expectation value from a vertex neighboring the destination vertex.
Solving, E = 1 0
Thanks to @Siva Bathula and @Brian Charlesworth for pointing out the issue with the original problem.