Problem:

A maze is a rectangular arrangement of blocks $($walls$)$ and open spaces $($paths$).$ A maze may have a path through it from a given start location to a given end location. You can usually move only one cell at a time. From each cell you choose your next move. Moves can only be into unblocked cells. In a restricted maze $($which we are describing here$)$ you can not cross your existing path i$.$e$.,$ once you visit a particular cell, you can't visit it again $($for all intents and purposes, a visited cell is blocked to future attempts to move$).$

For example, this maze: