Playing around with Streams and Lazy eval from week 7 lectures
Calculating primes using Sieve of Eratosthenes algorithm
Sqrt with guess as a lazy stream
The pouring problem, partway through lecture 7.5 ...
Replace recursive pattern matching path resolver with a foldRight solution.
complete the Path class
Finding all the paths
Inefficient solution that works
Optimise the search for a solution by avoiding already explored states
Further optimisation to avoid re-computing endState of paths repeatedly