You're trapped in a maze. There is a way out. Path junctions are all 3-way.
If you use the strategy of always taking the path going right, what will happen?
(Note: This problem is deliberarely vague.)
(In reply to
re(8): About the by Cheradenine)
It could be argued that the problem you have solved is one in which you "win" if you reach the exit and "lose" if you reach the starting node, and that you follow a random series of paths with no backtracking. However, the restriction of following the wall on your right changes things.
Without loss of generality, you could get rid of the exit, but mark one wall of one path with an exit point. The maze is now closed and consists of a bunch of loops. The exit point is on exactly one of these loops. There could be an arbitrarily large number of loops. The probability of finding the exit becomes the probability of starting on the correct loop. Is there any reason to assume that picking the "exit" loop is more probable than picking any other loop? Is there any reason to assume that a large number of nodes will not create a large number of loops?
re(9): About the
