I'm not convinced that a brute force solver that doesn't find the optimum path and which actually requires the recursion limit to be raised to execute on large

I'm not convinced that a brute force solver that doesn't find the optimum path and which actually requires the recursion limit to be raised to execute on large mazes without exception (!!) is the best demonstration of Python. This should be easy in any language, even assembly wouldn't be too hard!