Following is a demo of the Left Wall Heuristic program.
?- solve(Path, south), draw(Path). X S X X X X X P P X P X X X P P P X X X P X P X X P P X P X X E X X X X Path = [[2, 1], [2, 2], [3, 2], [3, 3], [4, 3], [5, 3], [5, 2], [5, 3], [5, 4], [5, 5], [5, 4], [5, 3], [4, 3], [3, 3], [3, 4], [3, 5], [2, 5], [2, 6]]