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)
"The problem is that you started at your expected solution (that the probability of finding an exit is 1/2), worked your way back to an initial topology (there are two loops), and then worked your way forward to the solution you wanted again."
i cant believe this! i have absolutely NOT done this. the truth is i have applied the 1/n to YOUR scheme and reached the 1/2 naturally. from the beginning of this discussion you have kept suggesting me "cheating" again and again. ffs
"Incidentally, it is possible to start at a node, follow the right wall, return to the starting node, and then hit the exit. This is a consequence of the three-path condition."
yes but a getting stuck (ie a loop) implies coming back to your initial path, not just to your initial node.
the only way forward in terms of reaching agreement is verifying the
result empirically. ill get back to you with the result, and that will
be final as far as im concerned, i have no desire to keep on
enduring your insults anymore.
re(14): About the
