Revert "Check recursive algorithm gives a correct result on scoreboard"

This reverts commit b1a7f7bdbf44ba606a2572a7709f632fe0bb9211.

main.go

@@ -137,23 +137,6 @@ func max(a, b int) int {
 
 var bestTotalScore int
 
-func save() {
-	if bestTotalScore < 10900000 {
-		// TODO find a better way to avoid too many writes
-		return
-	}
-	output.Truncate(0)
-	output.Seek(0, 0)
-	for _, c := range Cars {
-		fmt.Fprintf(output, "%d", len(c.Rides))
-		for _, ri := range c.Rides {
-			fmt.Fprintf(output, " %d", ri)
-		}
-		fmt.Fprintf(output, "\n")
-	}
-	fmt.Printf("%d\n", bestTotalScore)
-}
-
 // invariant : when entering and leaving function,
 // Sched has the "same" heap. Same means successive
 // popped values will be the same (but the internal
@@ -161,7 +144,6 @@ func save() {
 func Choose(cumulativeScore int, depth int) {
 	if cumulativeScore > bestTotalScore {
 		bestTotalScore = cumulativeScore
-		save()
 	}
 	c := Sched.Pop()
 	if c == nil {
@@ -180,7 +162,7 @@ func Choose(cumulativeScore int, depth int) {
 		if r.used {
 			continue
 		}
-		if r.Length() > 8000 {
+		if r.Length() > 6000 {
 			continue
 		}
 		if r.f < c.EarliestFinish(r) {
@@ -199,8 +181,8 @@ func Choose(cumulativeScore int, depth int) {
 			// shitty sort-of-correct-but-quite-incorrect way
 			// of picking next best n rides
 			n := 1
-			if rand.Intn(max(1, int(N/20))) == 0 {
-				n = 2
+			if rand.Intn(max(1, int(N/5))) == 0 {
+				n = 3
 			}
 			if len(bestRides) > n {
 				bestRides = bestRides[len(bestRides)-n:]
@@ -211,15 +193,6 @@ func Choose(cumulativeScore int, depth int) {
 	// 	fmt.Printf("Picking %d %d -> %d %d\n", bestRide.a, bestRide.b, bestRide.x, bestRide.y)
 	// }
 	if len(bestRides) != 0 {
-		if (len(bestRides)) >= 2 {
-			// if big difference in length, try both
-			// otherwise pick best according to score
-			d := abs(bestRides[0].r.length() - bestRides[1].r.length())
-			if d < 1000 {
-				bestRides = bestRides[1:]
-			}
-
-		}
 		for _, br := range bestRides {
 			r := br.r
 			r.used = true
@@ -263,6 +236,15 @@ func solve() {
 
 	// start recursion
 	Choose(0, 0)
+
+	for _, c := range Cars {
+		fmt.Fprintf(output, "%d", len(c.Rides))
+		for _, ri := range c.Rides {
+			fmt.Fprintf(output, " %d", ri)
+		}
+		fmt.Fprintf(output, "\n")
+	}
+	fmt.Printf("%d\n", bestTotalScore)
 }
 
 func main() {