X-Git-Url: http://git.scottworley.com/planeteer/blobdiff_plain/1539cc255c90943c2dbb4fa6146cc49b5e31d494..84be93794d0bd73e7716fc54b847afd6a7f1f6e4:/planeteer.go diff --git a/planeteer.go b/planeteer.go index cf68301..a6272f8 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" @@ -43,6 +43,8 @@ var fuel = flag.Int("fuel", 16, "Hyper Jump power left") var hold = flag.Int("hold", 300, "Size of your cargo hold") +var start_hold = flag.String("start_hold", "", "Start with a hold full of cargo") + var start_edens = flag.Int("start_edens", 0, "How many Eden Warp Units are you starting with?") @@ -63,6 +65,9 @@ var battery_price = flag.Int("battery_price", 0, "Today's Shield Battery price") var visit_string = flag.String("visit", "", "A comma-separated list of planets to make sure to visit") +var tomorrow_weight = flag.Float64("tomorrow_weight", 1.0, + "Weight for the expected value of tomorrow's trading. 0.0 - 1.0") + var cpuprofile = flag.String("cpuprofile", "", "write cpu profile to file") var visit_cache []string @@ -111,8 +116,9 @@ type Commodity struct { Limit int } type Planet struct { - BeaconOn bool - Private bool + BeaconOn bool + Private bool + TomorrowValue int /* Use relative prices rather than absolute prices because you can get relative prices without traveling to each planet. */ RelativePrices map[string]int @@ -241,9 +247,11 @@ type State struct { } const ( - CELL_UNINITIALIZED = -2147483647 + iota - CELL_BEING_EVALUATED - CELL_RUBISH + FROM_ROOT = -2147483647 + iota + FROM_UNINITIALIZED + VALUE_UNINITIALIZED + VALUE_BEING_EVALUATED + VALUE_RUBISH ) func EncodeIndex(dims, addr []int) int32 { @@ -273,15 +281,20 @@ func DecodeIndex(dims []int, index int32) []int { func CreateStateTable(data planet_data, dims []int) []State { table := make([]State, StateTableSize(dims)) for i := range table { - table[i].value = CELL_UNINITIALIZED + table[i].value = VALUE_UNINITIALIZED + table[i].from = FROM_UNINITIALIZED } addr := make([]int, NumDimensions) addr[Fuel] = *fuel addr[Edens] = *start_edens addr[Location] = data.p2i[*start] - addr[Traded] = 1 - table[EncodeIndex(dims, addr)].value = int32(*funds) + if *start_hold != "" { + addr[Hold] = data.c2i[*start_hold] + } + start_index := EncodeIndex(dims, addr) + table[start_index].value = int32(*funds) + table[start_index].from = FROM_ROOT return table } @@ -306,15 +319,15 @@ var cell_filled_count int func CellValue(data planet_data, dims []int, table []State, addr []int) int32 { my_index := EncodeIndex(dims, addr) - if table[my_index].value == CELL_BEING_EVALUATED { + if table[my_index].value == VALUE_BEING_EVALUATED { panic("Circular dependency") } - if table[my_index].value != CELL_UNINITIALIZED { + if table[my_index].value != VALUE_UNINITIALIZED { return table[my_index].value } - table[my_index].value = CELL_BEING_EVALUATED + table[my_index].value = VALUE_BEING_EVALUATED - best_value := int32(CELL_RUBISH) + best_value := int32(VALUE_RUBISH) best_source := make([]int, NumDimensions) other := make([]int, NumDimensions) copy(other, addr) @@ -426,6 +439,7 @@ func CellValue(data planet_data, dims []int, table []State, addr []int) int32 { } } } + other[Traded] = addr[Traded] } /* Buy a Device of Cloaking */ @@ -466,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< max_value { max_value = value max_index = index @@ -553,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 { @@ -565,7 +589,10 @@ func Commas(n int32) (s string) { } func DescribePath(data planet_data, dims []int, table []State, start int32) (description []string) { - for index := start; index > 0 && table[index].from > 0; index = table[index].from { + for index := start; table[index].from > FROM_ROOT; index = table[index].from { + if table[index].from == FROM_UNINITIALIZED { + panic(index) + } var line string addr := DecodeIndex(dims, index) prev := DecodeIndex(dims, table[index].from) @@ -647,6 +674,10 @@ func IndexCommodities(m *map[string]Commodity, start_at int) (map[string]int, [] func main() { flag.Parse() + if *start == "" || *funds == 0 { + print("--start and --funds are required. --help for more\n") + return + } if *cpuprofile != "" { f, err := os.Create(*cpuprofile) if err != nil { @@ -670,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.Printf("\r%11v Cost to visit %v\n", Commas(cost), visit()[i]) + } + final_state[Visit] = dims[Visit] - 1 + }