MATRIX SUM CHALLENGE

---

My solution to this /r/dailyprogrammer challenge

I used a greedy approach which do not use backtracking but is instead inspired by dynamic programming. This approach solves the 20x20 problem but can't solve the 97x97 in reasonable time. Better solutions using linear optimization have been proposed and can be found on the reddit thread.