X-Git-Url: http://git.scottworley.com/planeteer/blobdiff_plain/60025e5d0cf49e88a7c727b756c5ce96ec729969..b7a6e28b4e3619a9b8ff18285bba9876de52549c:/planeteer.go

diff --git a/planeteer.go b/planeteer.go
index f4a64aa..82650b9 100644
--- a/planeteer.go
+++ b/planeteer.go
@@ -19,7 +19,7 @@ package main
 
 import "flag"
 import "fmt"
-import "json"
+import "encoding/json"
 import "os"
 import "runtime/pprof"
 import "strings"
@@ -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)
@@ -535,7 +534,7 @@ func CellValue(data planet_data, dims []int, table []State, addr []int) int32 {
 	return table[my_index].value
 }
 
-func FindBestState(data planet_data, dims []int, table []State) int32 {
+func FinalState(dims []int) []int {
 	addr := make([]int, NumDimensions)
 	addr[Edens] = *end_edens
 	addr[Cloaks] = dims[Cloaks] - 1
@@ -545,6 +544,11 @@ func FindBestState(data planet_data, dims []int, table []State) int32 {
 	addr[Traded] = 1
 	addr[Hold] = 0
 	addr[UnusedCargo] = 0
+	// Fuel and Location are determined by FindBestState
+	return addr
+}
+
+func FindBestState(data planet_data, dims []int, table []State, addr []int) int32 {
 	max_index := int32(-1)
 	max_value := 0.0
 	max_fuel := 1
@@ -570,6 +574,9 @@ func FindBestState(data planet_data, dims []int, table []State) int32 {
 }
 
 func Commas(n int32) (s string) {
+	if n < 0 {
+		panic(n)
+	}
 	r := n % 1000
 	n /= 1000
 	for n > 0 {
@@ -694,14 +701,64 @@ func main() {
 	data.c2i, data.i2c = IndexCommodities(&data.Commodities, 1)
 	dims := DimensionSizes(data)
 	table := CreateStateTable(data, dims)
-	best := FindBestState(data, dims, table)
+	final_state := FinalState(dims)
+	best := FindBestState(data, dims, table, final_state)
 	print("\n")
 	if best == -1 {
 		print("Cannot acheive success criteria\n")
-	} else {
-		description := DescribePath(data, dims, table, best)
-		for i := len(description) - 1; i >= 0; i-- {
-			fmt.Println(description[i])
-		}
+		return
+	}
+	description := DescribePath(data, dims, table, best)
+	for i := len(description) - 1; i >= 0; i-- {
+		fmt.Println(description[i])
+	}
+
+	// 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
+	if *end_edens > 0 {
+		fmt.Println()
+	}
+	for extra_edens := 1; extra_edens <= *end_edens; extra_edens++ {
+		final_state[Edens] = *end_edens - extra_edens
+		alt_best := FindBestState(data, dims, table, final_state)
+		extra_funds := table[alt_best].value - table[best].value
+		fmt.Println("\rUse", extra_edens, "extra edens, make an extra",
+			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.Println("\r", Commas(cost), "Cost to visit", visit()[i])
+	}
+	final_state[Visit] = dims[Visit] - 1
+
 }