private Solution findOptimum(ArrayList<Mutantroach> mutantroaches) {
        Solution optimum = new Solution(mutantroaches.get(0));

        for (int i = 1; i < mutantroaches.size(); ++i) {
            Solution next = new Solution(mutantroaches.get(1));
            if (next.isBetterThan(optimum)) {
                optimum = next;
            }
        }

        return optimum;
    }