Given a complex maze, we find a path between two points and calculate this distance, in Prolog.
Load code included in repository:
| ?- consult(solveMaze.pl).
To test every possible path of the maze, run:
| ?- print_paths.
To check all the distances between every possible path on the maze, run:
| ?- print_distances.
Solutions will be written on the output.