Go point counting exercise for Haskell

This is a pretty complex exercise which requires coming up with an algorithm to detect connected groups.

It will be interesting to see what algorithms people come up with. I'm not sure my example is the most optimal form, maybe somebody will find a much better way.