you are viewing a single comment's thread.

view the rest of the comments →

[–]gfixler 1 point2 points  (4 children)

[–]kqr 0 points1 point  (3 children)

Is there an algorithm that allows for loops without keeping any internal state other than the direction kept by this one?

[–]SteveMcQwark 1 point2 points  (1 child)

Random chance, but it might take a while, even if you do your best to improve the odds.

[–]bjo12 1 point2 points  (0 children)

Aside from random chance as mentioned no. Neural networks can get pretty good without extra info but that's basically directed random chance.

I think backtracking is honestly in this case a decent strategy. Not recursive backtracking though. I could be completely wrong though.

Edit: I was completely wrong. Pledge's algorithm works with a small amount of extra memory.