I used to give this problem to my graphics students. Here’s one 2D version
https://drive.google.com/drive/folders/1fTNJb4hhgR-6LySQspgM9k-J27KwuLpl?usp=sharing <https://drive.google.com/drive/folders/1fTNJb4hhgR-6LySQspgM9k-J27KwuLpl?usp=sharing> It will generate a new maze each time it’s rerun. Every cell is connected to every other cell. Next step is to knock out two edge segments for an entrance and exit. Extrude all the segments up to get a 3D maze. Ed > On Feb 28, 2021, at 10:33 AM, Stephen Guerin <stephen.gue...@simtable.com> > wrote: > > Late September 2009, a young M0ose (Cody Smith) walked into the Santa Fe > Complex. > > He approached me and said he heard about the place and wanted to help > contribute. He showed me some of his computational sketches on his laptop. > > One that caught my eye was his Javascript breadth-first maze solver: > http://www.m0ose.com/oldpage/breadth_first_with_graph.html > <http://www.m0ose.com/oldpage/breadth_first_with_graph.html> > > and a genetic algorithm solver: > http://www.m0ose.com/oldpage/maze_evolution8.html > <http://www.m0ose.com/oldpage/maze_evolution8.html> > > His repository has grown over the decade: http://m0ose.com <http://m0ose.com/> > > Note his maze generator here: > http://www.m0ose.com/javascripts/maze/test1.html > <http://www.m0ose.com/javascripts/maze/test1.html> > And his WebGL Doom maze walker from Ed Angel's WebGL class at SF_X: > http://www.m0ose.com/javascripts/maze/testGl.html > <http://www.m0ose.com/javascripts/maze/testGl.html> > > -Stephen > _______________________________________________________________________ > stephen.gue...@simtable.com <mailto:stephen.gue...@simtable.com> > CEO, Simtable http://www.simtable.com <http://www.simtable.com/> > 1600 Lena St #D1, Santa Fe, NM 87505 > office: (505)995-0206 mobile: (505)577-5828 > twitter: @simtable > z <http://zoom.com/j/5055775828>oom.simtable.com <http://oom.simtable.com/> > > > On Sat, Feb 27, 2021 at 5:10 PM cody dooderson <d00d3r...@gmail.com > <mailto:d00d3r...@gmail.com>> wrote: > I am assuming this is a 2D maze. Wikipedia does a better job at explaining > the problems with wall following than I can. > > If the maze is not simply-connected (i.e. if the start or endpoints are in > the center of the structure surrounded by passage loops, or the pathways > cross over and under each other and such parts of the solution path are > surrounded by passage loops), this method will not reach the goal. > > > > > > On Sat, Feb 27, 2021, 1:48 PM <thompnicks...@gmail.com > <mailto:thompnicks...@gmail.com>> wrote: > Hi, All, > > > > Due to a review I have been working on, I have been dragged back into > thinking about maze learning in rats. Any animal I have ever known, when > confined, will explore the boundaries of its enclosure. Cows, for instance > will beat a path just inside the barbed wire that encloses them. So a maze > is not only a series of pathways but it is also an enclosure. If the rat > puts his left whisker against the left wall of the maze, he will eventually > get to the goal box, right. It works with the Hampton Court Maze. On the > second run, he can now use odor cues, such that any time he encounters his > own odor both entering and leaving a passage way, he should just skip that > passage way. > > > > So I am wondering, you topologists (??) out there, how general is the > statement, “every maze is an enclosure” and what is the limitation on the > idea that any maze can be solved by putting your right or left hand on a wall > and continuing to walk until you find the goal or are let out of the maze. > Now I should quickly say that rat mazes are usually composed of a series of > bifurcating choice points, where the rat can go either left or right. Some > choices lead ultimately to dead ends. In sum, a runway in such a maze can go > straight, turn R or L without choice or form a T with a right or left choice. > My intuition is that no such maze can be designed that does not permit the > boundary following strategy. > > > > Nick > > > > Nick Thompson > > thompnicks...@gmail.com <mailto:thompnicks...@gmail.com> > https://wordpress.clarku.edu/nthompson/ > <https://wordpress.clarku.edu/nthompson/> > > > - .... . -..-. . -. -.. -..-. .. ... -..-. .... . .-. . > FRIAM Applied Complexity Group listserv > Zoom Fridays 9:30a-12p Mtn GMT-6 bit.ly/virtualfriam > <http://bit.ly/virtualfriam> > un/subscribe http://redfish.com/mailman/listinfo/friam_redfish.com > <http://redfish.com/mailman/listinfo/friam_redfish.com> > FRIAM-COMIC http://friam-comic.blogspot.com/ > <http://friam-comic.blogspot.com/> > archives: http://friam.471366.n2.nabble.com/ > <http://friam.471366.n2.nabble.com/> > - .... . -..-. . -. -.. -..-. .. ... -..-. .... . .-. . > FRIAM Applied Complexity Group listserv > Zoom Fridays 9:30a-12p Mtn GMT-6 bit.ly/virtualfriam > <http://bit.ly/virtualfriam> > un/subscribe http://redfish.com/mailman/listinfo/friam_redfish.com > <http://redfish.com/mailman/listinfo/friam_redfish.com> > FRIAM-COMIC http://friam-comic.blogspot.com/ > <http://friam-comic.blogspot.com/> > archives: http://friam.471366.n2.nabble.com/ > <http://friam.471366.n2.nabble.com/> > - .... . -..-. . -. -.. -..-. .. ... -..-. .... . .-. . > FRIAM Applied Complexity Group listserv > Zoom Fridays 9:30a-12p Mtn GMT-6 bit.ly/virtualfriam > un/subscribe http://redfish.com/mailman/listinfo/friam_redfish.com > FRIAM-COMIC http://friam-comic.blogspot.com/ > archives: http://friam.471366.n2.nabble.com/
- .... . -..-. . -. -.. -..-. .. ... -..-. .... . .-. . FRIAM Applied Complexity Group listserv Zoom Fridays 9:30a-12p Mtn GMT-6 bit.ly/virtualfriam un/subscribe http://redfish.com/mailman/listinfo/friam_redfish.com FRIAM-COMIC http://friam-comic.blogspot.com/ archives: http://friam.471366.n2.nabble.com/
