super long run "monte carlo" (it's not really mc)

main.go

@@ -136,6 +136,7 @@ func max(a, b int) int {
 }
 
 var bestTotalScore int
+var movingFromDepth int
 
 func save() {
 	if bestTotalScore < 10900000 {
@@ -216,6 +217,8 @@ func (c *Car) pickRandomRide() *Ride {
 	return nil
 }
 
+var shots int
+
 // invariant : when entering and leaving function,
 // Sched has the "same" heap. Same means successive
 // popped values will be the same (but the internal
@@ -229,13 +232,27 @@ func Choose(cumulativeScore int, depth int, fromDepth int) (int, bool) {
 	c := Sched.Pop()
 	if c == nil {
 		// At this point we have a complete configuration
-		fmt.Printf("score obtained: %d depth: %d\n", cumulativeScore, depth)
 		if cumulativeScore >= bestTotalScore {
-			bestTotalScore = cumulativeScore
+			if cumulativeScore != bestTotalScore {
+				save()
+				bestTotalScore = cumulativeScore
+				// movingFromDepth = fromDepth
+				shots = 0
+				movingFromDepth += 1
+			}
+			shots += 1
+			if shots-1 == 1 {
+				shots = 0
+				movingFromDepth += 1
+			}
 			// Go back to random depth and make a new change
-			return rand.Intn(depth), false
+			// rnd := rand.Intn(depth-movingFromDepth-1) + 1 + movingFromDepth
+			rnd := movingFromDepth
+			fmt.Printf("best score! %d depth: %d fromDepth: %d movingFromDepth: %d rnd: %d\n", cumulativeScore, depth, fromDepth, movingFromDepth, rnd)
+			return rnd, false
 		} else {
 			// Go back to fix change that lowered our score
+			fmt.Printf("lesser score: %d depth: %d fromDepth: %d movingFromDepth: %d\n", cumulativeScore, depth, fromDepth, movingFromDepth)
 			return fromDepth, true
 		}
 	}
@@ -268,7 +285,7 @@ func Choose(cumulativeScore int, depth int, fromDepth int) (int, bool) {
 }
 
 func solve() {
-	rand.Seed(1)
+	rand.Seed(100000)
 
 	sort.Sort(ByEndtime(Rides))