Conjecture that the class of all mazes is not solvable

Let $\mathcal{M}$ denote the class of all mazes under consideration. All-maze nonsolvability conjecture. There is no algorithm that solves the class $\mathcal{M}$ of all mazes. The paper introduces this as an open problem in the opposite direction to its positive solvability results; no resolution is given.