First successful attempt at maze parsing and solving It struggles with large mazes (and ones with wide "paths") but it can solve the smaller cases. We skip in-route loops, but more optimisation is required to prune more routes and to use more efficient/Haskell-y methods.

println("Hello, world!")