maze-solver This course project finds an optimal solution, if possible, for a maze represented as a string of 0's and 1's Build gcc mopsolver.c -o mopsolver Run ./mopsolver -h for help Example
