The Leader–Spink maze solvability conjecture with one-column vertical gaps

Let HNEs and VNEs denote horizontal and vertical edges removed from the square lattice maze, respectively. Consider mazes with arbitrarily many HNEs and arbitrarily many VNEs in one column. One-column maze solvability conjecture. There exists an algorithm that solves the set of all such mazes. This is posed in the paper's open-problems section as a problem expected to require techniques similar to those developed in the paper; its status is open.