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(13): About the by friedlinguini)
"Essentially, what you've just "proven" is that the average random maze, regardless of size, has exactly two loops.
nope, ive proven that a RIGHT HAND LOOP in a random maze has on average n/2 paths. so a random maze
will ON AVERAGE have two RIGHT HAND LOOPS. the maze can have more/different loops if you follow other strategies.
"I challenge you to draw any maze satisfying the 3-path condition with more than two nodes for which this is true."
-------------
easy *A B*---
| -------------
| exit
| C / D
*----------------*-
| |
| |
| ---------------------
loop 1 A-top path-B-bottom path-A-B-A-...
loop2 C-up-A-B-B-A-C-bottom-D-exit-path-C-A...
re(14): About the
