A little refactoring

I don't need each separate function
Very naive solver to bruteforce the best path

This doesn't work because it takes forever to calculate input-huge
Ignores Haskell binary files from git
New lookahead solution that checks n nearest for m depth

This isn't great and is less efficient than the naive greedy solution
Ignore more haskell files
Tweaking the parameters
Adding an unoptimized solution for BotcleanPartial

https://www.hackerrank.com/challenges/botcleanv2

This should also keep track of previously seen-but-not-reaped squares