No…because it was the entrance. You assume, being human, that entrance and exit are equivalent. The rule does not. Also if there is only one entrance/exit the rule takes you the the centre of the maze…then back out to that exit.
What i understood froma this both experements is that the respective hand rule fully explores the area on the respective side of the diagonal between exits. So for the average maze with exits on opposite sides the complexity will be N , as N - exploring the whole maze once.
This really helped me understand why the left hand rule works. It's less riding the left wall, and more "Trying every path from left to right". If you go the wrong way, you follow the left wall there, then you cycle backwards with the right (now left), until the point of error and repeat
@@mlvluu9836 well that defeats the purpose of a algorithm, ofcourse you have path finding algorithms that do know where its target is like A* but if you wanna solve a maze that may not be the case,
I love how casually it strolls right past the exit
That's the algorithm.
It ignores the obvious, so it follows the pattern it was set with no matter what.
*looks over*
oh my god! The end! Freedom!
*sees path*
well, my maze solving knowledge says to stay on the left, soooooooo. . .
Yeah I think it should always have the parameter that if it comes in to contact with the exit no matter what it stops.
Looking for loot it seems.
No…because it was the entrance. You assume, being human, that entrance and exit are equivalent. The rule does not. Also if there is only one entrance/exit the rule takes you the the centre of the maze…then back out to that exit.
This is why its harder to solve a maze when inside the maze than above the maze
*sees exit*
The algorithm: "Must follow wall at all costs!"
*takes the first left*
"this little maneuver is gonna cost us 51 years"
1:50 This is pain.
2:20 THIS is pain
@@DanielLenrd 2:24 *THIS* is pain
What i understood froma this both experements is that the respective hand rule fully explores the area on the respective side of the diagonal between exits. So for the average maze with exits on opposite sides the complexity will be N , as N - exploring the whole maze once.
"Today! We put a tracking device in someone's arm and forced them through a maze, they have to keep their left hand on the wall, or else!"
This really helped me understand why the left hand rule works. It's less riding the left wall, and more "Trying every path from left to right". If you go the wrong way, you follow the left wall there, then you cycle backwards with the right (now left), until the point of error and repeat
Now I *really* wanna play "Maze Craze" on the Atari 2600 again!
This is really satisfying ngl
0:47 a human would have known it was on the wrong path and started over, saving minutes of time
Not if they were inside the maze and didn't know how far they'd walked, in what direction, and/or how big the maze was
Coud this be improved by avoiding areas enclosed by what has already been crossed?
Actually, that wouldn’t work, because what if the exit is inside that enclosed space?
@@GAND-OZZ Simply don’t count the wall with the exit as a boundary that can enclose.
@@mlvluu9836 well that defeats the purpose of a algorithm, ofcourse you have path finding algorithms that do know where its target is like A* but if you wanna solve a maze that may not be the case,
The best way to escape a maze
So the secret sauce to solve any maze in real life is to carry two colors - Blue and green.
Had to fill in everything above and to the right of the actual path.
Can you help me to make it with python?
This is how I solve a maze
gj
me sleep dream wall follow
Wallflower