![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
(no subject)
Holy crap, a fractal maze???
("A", "B", and "C" are all full copies of the whole. Keep track of the stack! You can't exit a lower-level copy somewhere where there's no external connection. (For example, if you're in C, you can't exit via the green path on the lower left, because then there's nowhere to go.) And you can't exit the entire maze, of course.)
Start at the negative terminal; end at the positive.
(by Mark J. P. Wolf.)
("A", "B", and "C" are all full copies of the whole. Keep track of the stack! You can't exit a lower-level copy somewhere where there's no external connection. (For example, if you're in C, you can't exit via the green path on the lower left, because then there's nowhere to go.) And you can't exit the entire maze, of course.)
Start at the negative terminal; end at the positive.
(by Mark J. P. Wolf.)
Re: you rule
I devised an algorithm that I could use to solve the problem in my head, and proved that if a solution existed, I could find it using said algorithm. Then I went to back to work.
Re: you rule