Advent of Code - Year 2015, Day 13

Problem statement:

This problem seems complicated, because it talks about arranging people around a table. However, if you consider that the people are cities and the happiness points are travelling distance, it becomes apparent that this is another version of the traveling salesman problem. You'll notice in the code that the solution is basically the same solution as for day 9.