Enter a maze filename: maze0.txt
Starting maze:
.#
.C
H#
Beginning to solve.
Solving from (2, 0).
Solving from (1, 0).
Solving from (0, 0).
Solving from (1, 1).
Solution: NE
Solve was called 4 times.
The length of the path is 2 steps.

Final maze:
.#
oC
o#