4 ms·
Do you remember which year that was? I'm fairly sure I encountered that project, and I think I found some way to cheat my way out of it without actually solving
by marssaxman 2y ago
Do you remember which year that was? I'm fairly sure I encountered that project, and I think I found some way to cheat my way out of it without actually solving the maze, though I can't recall the details.
- bell-cot 2y agoAny reason why "follow the right-hand wall" (and perhaps a few little scratches on the plywood) wouldn't work?
- cortesoft 2y ago"Follow the right-hand wall" only works if all the walls are connected. It does not work if there are free standing walls.
- masfuerte 2y agoVery true! I was here [1] a few weeks ago. I'd never done a real-life maze before and assumed it would be easy but with free-standing walls it was quite challenging. I think I explored every branch before reaching the centre. [1]: https://mazes.co.uk/ https://mazes.co.uk/
- bell-cot 2y agoWith some discreet scratches on the plywood, a "mostly just follow the right-hand wall" rule works.* Think of each free-standing section of wall as a node in a graph. The graph's edges connect free-standing wall sections which are adjacent. The task is to find (and circumnavigate) all the graph's nodes. Yes, it could be very tedious to search this alternative representation of the maze for the exit node. Far more likely not - the description was "maybe 150 foot square", not "multi-acre corn maze". *Assuming a two-dimensional maze, a finite number of free-standing wall sections, flat spacetime, and non-zero lower bound on the width of the maze's paths.
- deleted 2y ago[deleted]
- leptons 2y agoI'm almost certain it was 2002. I think they tried another maze the following year, but I avoided it completely.