X-Git-Url: http://git.scottworley.com/planeteer/blobdiff_plain/7881bdfbb28403c6336ed6ef9248987d375b1cb7..a29aebecc25a3b2c40c86f11818d79e367b5ce30:/planeteer.go diff --git a/planeteer.go b/planeteer.go index 3f5951f..eb78bce 100644 --- a/planeteer.go +++ b/planeteer.go @@ -68,6 +68,9 @@ var visit_string = flag.String("visit", "", var tomorrow_weight = flag.Float64("tomorrow_weight", 1.0, "Weight for the expected value of tomorrow's trading. 0.0 - 1.0") +var extra_stats = flag.Bool("extra_stats", true, + "Show additional information of possible interest") + var cpuprofile = flag.String("cpuprofile", "", "write cpu profile to file") var visit_cache []string @@ -167,16 +170,18 @@ func ReadData() (data planet_data) { * independent -- some combinations are illegal and not used. They are * handled as three dimensions rather than one for simplicity. Placing * these dimensions first causes the unused cells in the table to be - * grouped together in large blocks. This keeps them from polluting - * cache lines, and if they are large enough, allows the memory manager - * to swap out entire pages. + * grouped together in large blocks. This keeps the unused cells from + * polluting cache lines, and if the spans of unused cells are large + * enough, allows the memory manager to swap out entire pages. * * If the table gets too big to fit in RAM: * * Combine the Edens, Cloaks, and UnusedCargo dimensions. Of the * 24 combinations, only 15 are legal: a 38% savings. - * * Reduce the size of the Fuel dimension to 3. We only ever look - * backwards 2 units, so just rotate the logical values through - * the same 3 physical addresses. This is good for an 82% savings. + * * Reduce the size of the Fuel dimension to 3. Explicit iteration + * only ever needs to look backwards 2 units, so the logical values + * can rotate through the same 3 physical addresses. This would be + * good for an 82% savings. Note that explicit iteration went away + * in 0372f045. * * Reduce the size of the Edens dimension from 3 to 2, for the * same reasons as Fuel above. 33% savings. * * Buy more ram. (Just sayin'. It's cheaper than you think.) @@ -207,13 +212,13 @@ func bint(b bool) int { return 0 } -func DimensionSizes(data planet_data) []int { +func DimensionSizes(data planet_data) LogicalIndex { eden_capacity := data.Commodities["Eden Warp Units"].Limit if *start_edens > eden_capacity { eden_capacity = *start_edens } cloak_capacity := bint(*cloak) - dims := make([]int, NumDimensions) + dims := make(LogicalIndex, NumDimensions) dims[Edens] = eden_capacity + 1 dims[Cloaks] = cloak_capacity + 1 dims[UnusedCargo] = eden_capacity + cloak_capacity + 1 @@ -234,7 +239,11 @@ func DimensionSizes(data planet_data) []int { return dims } -func StateTableSize(dims []int) int { +type Value int32 +type PhysicalIndex int32 +type LogicalIndex []int + +func StateTableSize(dims LogicalIndex) int { product := 1 for _, size := range dims { product *= size @@ -243,7 +252,8 @@ func StateTableSize(dims []int) int { } type State struct { - value, from int32 + value Value + from PhysicalIndex } const ( @@ -254,7 +264,7 @@ const ( VALUE_RUBISH ) -func EncodeIndex(dims, addr []int) int32 { +func EncodeIndex(dims, addr LogicalIndex) PhysicalIndex { index := addr[0] if addr[0] > dims[0] { panic(0) @@ -265,27 +275,28 @@ func EncodeIndex(dims, addr []int) int32 { } index = index*dims[i] + addr[i] } - return int32(index) + return PhysicalIndex(index) } -func DecodeIndex(dims []int, index int32) []int { - addr := make([]int, NumDimensions) +func DecodeIndex(dims LogicalIndex, index PhysicalIndex) LogicalIndex { + scratch := int(index) + addr := make(LogicalIndex, NumDimensions) for i := NumDimensions - 1; i > 0; i-- { - addr[i] = int(index) % dims[i] - index /= int32(dims[i]) + addr[i] = scratch % dims[i] + scratch /= dims[i] } - addr[0] = int(index) + addr[0] = scratch return addr } -func CreateStateTable(data planet_data, dims []int) []State { +func CreateStateTable(data planet_data, dims LogicalIndex) []State { table := make([]State, StateTableSize(dims)) for i := range table { table[i].value = VALUE_UNINITIALIZED table[i].from = FROM_UNINITIALIZED } - addr := make([]int, NumDimensions) + addr := make(LogicalIndex, NumDimensions) addr[Fuel] = *fuel addr[Edens] = *start_edens addr[Location] = data.p2i[*start] @@ -293,7 +304,7 @@ func CreateStateTable(data planet_data, dims []int) []State { addr[Hold] = data.c2i[*start_hold] } start_index := EncodeIndex(dims, addr) - table[start_index].value = int32(*funds) + table[start_index].value = Value(*funds) table[start_index].from = FROM_ROOT return table @@ -302,13 +313,13 @@ func CreateStateTable(data planet_data, dims []int) []State { /* CellValue fills in the one cell at address addr by looking at all * the possible ways to reach this cell and selecting the best one. */ -func Consider(data planet_data, dims []int, table []State, there []int, value_difference int, best_value *int32, best_source []int) { +func Consider(data planet_data, dims LogicalIndex, table []State, there LogicalIndex, value_difference int, best_value *Value, best_source LogicalIndex) { there_value := CellValue(data, dims, table, there) - if value_difference < 0 && int32(-value_difference) > there_value { + if value_difference < 0 && Value(-value_difference) > there_value { /* Can't afford this transition */ return } - possible_value := there_value + int32(value_difference) + possible_value := there_value + Value(value_difference) if possible_value > *best_value { *best_value = possible_value copy(best_source, there) @@ -317,7 +328,7 @@ func Consider(data planet_data, dims []int, table []State, there []int, value_di var cell_filled_count int -func CellValue(data planet_data, dims []int, table []State, addr []int) int32 { +func CellValue(data planet_data, dims LogicalIndex, table []State, addr LogicalIndex) Value { my_index := EncodeIndex(dims, addr) if table[my_index].value == VALUE_BEING_EVALUATED { panic("Circular dependency") @@ -327,9 +338,9 @@ func CellValue(data planet_data, dims []int, table []State, addr []int) int32 { } table[my_index].value = VALUE_BEING_EVALUATED - best_value := int32(VALUE_RUBISH) - best_source := make([]int, NumDimensions) - other := make([]int, NumDimensions) + best_value := Value(VALUE_RUBISH) + best_source := make(LogicalIndex, NumDimensions) + other := make(LogicalIndex, NumDimensions) copy(other, addr) planet := data.i2p[addr[Location]] @@ -480,8 +491,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< 0 { @@ -586,7 +599,74 @@ func Commas(n int32) (s string) { return } -func DescribePath(data planet_data, dims []int, table []State, start int32) (description []string) { +func FighterAndShieldCost(data planet_data, dims LogicalIndex, table []State, best PhysicalIndex) { + if *drones == 0 && *batteries == 0 { + return + } + fmt.Println() + if *drones > 0 { + final_state := FinalState(dims) + 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") + } + if *batteries > 0 { + final_state := FinalState(dims) + 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") + } +} + +func EndEdensCost(data planet_data, dims LogicalIndex, table []State, best PhysicalIndex) { + if *end_edens == 0 { + return + } + fmt.Println() + final_state := FinalState(dims) + 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/Value(extra_edens)), "per eden)") + } +} + +func VisitCost(data planet_data, dims LogicalIndex, table []State, best PhysicalIndex) { + if dims[Visit] == 1 { + return + } + fmt.Println() + final_state := FinalState(dims) + 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]) + } +} + +func EndLocationCost(data planet_data, dims LogicalIndex, table []State, best PhysicalIndex) { + if len(end()) == 0 { + return + } + fmt.Println() + final_state := FinalState(dims) + 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%11v Cost of --end %v\n", Commas(cost), save_end_string) + *end_string = save_end_string +} + +func DescribePath(data planet_data, dims LogicalIndex, table []State, start PhysicalIndex) (description []string) { for index := start; table[index].from > FROM_ROOT; index = table[index].from { if table[index].from == FROM_UNINITIALIZED { panic(index) @@ -711,16 +791,10 @@ func main() { fmt.Println(description[i]) } - // 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)") + if *extra_stats { + FighterAndShieldCost(data, dims, table, best) + EndEdensCost(data, dims, table, best) + VisitCost(data, dims, table, best) + EndLocationCost(data, dims, table, best) } }