This was not easy challenge 🙂 optimization for two dimensions require either full permutations either heuristic approach which will be fast but not optimal in many cases.
We got only 4 submissions, our heroes are:
1. Marc – Pascal
2. Nigel Mollett – C#
3. Piotr Gapinski – Prolog
4. Todor Nikodimov – C++
How Piotr manages to solve such hard problems with Prolog is mystery to me, but this just prove that once you know how to solve problem you can code it in any language 🙂
You can enjoy the solutions at GitHub as usual https://github.com/OLIMEX/WPC/tree/master/ISSUE-32