With 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

With 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.