Game Task: There is a matrix of fare across destinations. At the beginning, the game proposes an initial base route which is not optimal. By performing permutations over the matrix elements, it is required to find an optimal route. The optimal route has the smallest total fare. A player has a visual monitoring of how far the current route is from the target optimal one.
