code: def searchtop(self,n=10):
                      
          solutions = PriorityQueue([], lambda x: x.score, self.minimize, length=n, blockworse=False, blockequal=False,duplicates=False)
          for solution in self:
              solutions.append(solution)
          return solutions
docs: Return the top n best resulta (or possibly less if not enough is found)