Following is a demo of the maze my thing program.
This heuristic finds the path with the least amount of turns preferring to go stright. Demo: ?- solve(Path). turn turn turn turn Path = [[2, 1, south], [2, 2, south], [3, 2, east], [3, 3, south], [3, 4, south], [3, 5, south], [2, 5, west], [2, 6, south]]