code: def best_unique_genomes(self, n):
          
          best_unique = {}
          for g in self.most_fit_genomes:
              best_unique[g.key] = g
          best_unique_list = list(best_unique.values())
  
          def key(genome):
              return genome.fitness
  
          return sorted(best_unique_list, key=key, reverse=True)[:n]
docs: Returns the most n fit genomes, with no duplication.