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(10): About the by Cheradenine)

I wouldn't necessarily claim that it is 1/n, since I don't have a function for the number of loops per node. I'd be willing to say that it is something along the order of 1/O(n), though.

Posted by friedlinguini on 2002-07-04 05:41:56