X-Git-Url: http://git.scottworley.com/planeteer/blobdiff_plain/7881bdfbb28403c6336ed6ef9248987d375b1cb7..1fc3e5f6bd49d56f3c3ec9584a29aaa1467c7096:/planeteer.go

diff --git a/planeteer.go b/planeteer.go
index 3f5951f..a3fb84c 100644
--- a/planeteer.go
+++ b/planeteer.go
@@ -480,8 +480,7 @@ func CellValue(data planet_data, dims []int, table []State, addr []int) int32 {
 	}
 
 	/* Visit this planet */
-	var i uint
-	for i = 0; i < uint(len(visit())); i++ {
+	for i := uint(0); i < uint(len(visit())); i++ {
 		if addr[Visit]&(1<<i) != 0 && visit()[i] == data.i2p[addr[Location]] {
 			other[Visit] = addr[Visit] & ^(1 << i)
 			Consider(data, dims, table, other, 0, &best_value, best_source)
@@ -575,6 +574,9 @@ func FindBestState(data planet_data, dims []int, table []State, addr []int) int3
 }
 
 func Commas(n int32) (s string) {
+	if n < 0 {
+		panic(n)
+	}
 	r := n % 1000
 	n /= 1000
 	for n > 0 {
@@ -711,7 +713,28 @@ func main() {
 		fmt.Println(description[i])
 	}
 
-	// Use extra eden warps
+	// Ok, that was the important stuff.  Now some fun stuff.
+
+	// Calculate total cost of fighters and shields
+	if *drones > 0 || *batteries > 0 {
+		fmt.Println()
+	}
+	if *drones > 0 {
+		final_state[BuyFighters] = 0
+		alt_best := FindBestState(data, dims, table, final_state)
+		cost := table[alt_best].value - table[best].value
+		fmt.Println("\rDrones were", float64(cost)/float64(*drones), "each")
+		final_state[BuyFighters] = 1
+	}
+	if *batteries > 0 {
+		final_state[BuyShields] = 0
+		alt_best := FindBestState(data, dims, table, final_state)
+		cost := table[alt_best].value - table[best].value
+		fmt.Println("\rBatteries were", float64(cost)/float64(*batteries), "each")
+		final_state[BuyShields] = 1
+	}
+
+	// Use extra eden warps / cost of --end_edends
 	if *end_edens > 0 {
 		fmt.Println()
 	}
@@ -723,4 +746,30 @@ func main() {
 			Commas(extra_funds), "(",
 			Commas(extra_funds/int32(extra_edens)), "per eden)")
 	}
+	final_state[Edens] = *end_edens
+
+	// Cost of visiting places
+	if dims[Visit] > 1 {
+		fmt.Println()
+	}
+	for i := uint(0); i < uint(len(visit())); i++ {
+		all_bits := dims[Visit] - 1
+		final_state[Visit] = all_bits & ^(1 << i)
+		alt_best := FindBestState(data, dims, table, final_state)
+		cost := table[alt_best].value - table[best].value
+		fmt.Printf("\r%11v Cost to visit %v\n", Commas(cost), visit()[i])
+	}
+	final_state[Visit] = dims[Visit] - 1
+
+	// Cost of --end
+	if len(end()) > 0 {
+		save_end_string := *end_string
+		*end_string = ""
+		end_cache = nil
+		alt_best := FindBestState(data, dims, table, final_state)
+		cost := table[alt_best].value - table[best].value
+		fmt.Printf("\r\n%11v Cost of --end %v\n", Commas(cost), save_end_string)
+		*end_string = save_end_string
+	}
+
 }