def METHOD_NAME(self):
    # avgLocs: avg number of available locs, the higher the value the more open is a seed
    # open[1-4]4: how many location you have to visit to open 1/4, 1/2, 3/4, all locations.
    #             gives intel about prog item repartition.
    self.solverStats = {}
    self.solverStats['avgLocs'] = int(sum(self.nbAvailLocs)/len(self.nbAvailLocs))
    derivative = []
    for i in range(len(self.nbAvailLocs)-1):
        d = self.nbAvailLocs[i+1] - self.nbAvailLocs[i]
        derivative.append(d)
    sumD = sum([d for d in derivative if d != -1])
    (sum14, sum24, sum34, sum44) = (sumD/4, sumD/2, sumD*3/4, sumD)
    (open14, open24, open34, open44) = (-1, -1, -1, -1)
    sumD = 0
    for (i, d) in enumerate(derivative, 1):
        if d == -1:
            continue
        sumD += d
        if sumD >= sum14 and open14 == -1:
            open14 = i
            continue
        if sumD >= sum24 and open24 == -1:
            open24 = i
            continue
        if sumD >= sum34 and open34 == -1:
            open34 = i
            continue
        if sumD >= sum44 and open44 == -1:
            open44 = i
            break
    self.solverStats['open14'] = open14 if open14 != -1 else 0
    self.solverStats['open24'] = open24 if open24 != -1 else 0
    self.solverStats['open34'] = open34 if open34 != -1 else 0
    self.solverStats['open44'] = open44 if open44 != -1 else 0