X-Git-Url: http://git.scottworley.com/planeteer/blobdiff_plain/a5a4d82482a774620eda5f0bfbbe26bec0074ff7..fc93fd36d80c2e19b770e0fd57eacd6c8b2779c6:/planeteer.go diff --git a/planeteer.go b/planeteer.go index 7cea3cb..2bb1b55 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.) @@ -242,8 +247,12 @@ func StateTableSize(dims []int) int { return product } +type Value int32 +type PhysicalIndex int32 + type State struct { - value, from int32 + value Value + from PhysicalIndex } const ( @@ -254,7 +263,7 @@ const ( VALUE_RUBISH ) -func EncodeIndex(dims, addr []int) int32 { +func EncodeIndex(dims, addr []int) PhysicalIndex { index := addr[0] if addr[0] > dims[0] { panic(0) @@ -265,16 +274,17 @@ 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 { +func DecodeIndex(dims []int, index PhysicalIndex) []int { + scratch := int(index) addr := make([]int, 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 } @@ -293,7 +303,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 +312,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 []int, table []State, there []int, value_difference int, best_value *Value, best_source []int) { 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 +327,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 []int, table []State, addr []int) Value { my_index := EncodeIndex(dims, addr) if table[my_index].value == VALUE_BEING_EVALUATED { panic("Circular dependency") @@ -327,7 +337,7 @@ 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_value := Value(VALUE_RUBISH) best_source := make([]int, NumDimensions) other := make([]int, NumDimensions) copy(other, addr) @@ -548,8 +558,8 @@ func FinalState(dims []int) []int { return addr } -func FindBestState(data planet_data, dims []int, table []State, addr []int) int32 { - max_index := int32(-1) +func FindBestState(data planet_data, dims []int, table []State, addr []int) PhysicalIndex { + max_index := PhysicalIndex(-1) max_value := 0.0 max_fuel := 1 if *fuel == 0 { @@ -573,7 +583,7 @@ func FindBestState(data planet_data, dims []int, table []State, addr []int) int3 return max_index } -func Commas(n int32) (s string) { +func Commas(n Value) (s string) { if n < 0 { panic(n) } @@ -588,7 +598,7 @@ func Commas(n int32) (s string) { return } -func FighterAndShieldCost(data planet_data, dims []int, table []State, best int32) { +func FighterAndShieldCost(data planet_data, dims []int, table []State, best PhysicalIndex) { if *drones == 0 && *batteries == 0 { return } @@ -609,7 +619,7 @@ func FighterAndShieldCost(data planet_data, dims []int, table []State, best int3 } } -func EndEdensCost(data planet_data, dims []int, table []State, best int32) { +func EndEdensCost(data planet_data, dims []int, table []State, best PhysicalIndex) { if *end_edens == 0 { return } @@ -621,11 +631,11 @@ func EndEdensCost(data planet_data, dims []int, table []State, best int32) { 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)") + Commas(extra_funds/Value(extra_edens)), "per eden)") } } -func VisitCost(data planet_data, dims []int, table []State, best int32) { +func VisitCost(data planet_data, dims []int, table []State, best PhysicalIndex) { if dims[Visit] == 1 { return } @@ -640,7 +650,7 @@ func VisitCost(data planet_data, dims []int, table []State, best int32) { } } -func EndLocationCost(data planet_data, dims []int, table []State, best int32) { +func EndLocationCost(data planet_data, dims []int, table []State, best PhysicalIndex) { if len(end()) == 0 { return } @@ -655,7 +665,7 @@ func EndLocationCost(data planet_data, dims []int, table []State, best int32) { *end_string = save_end_string } -func DescribePath(data planet_data, dims []int, table []State, start int32) (description []string) { +func DescribePath(data planet_data, dims []int, 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) @@ -780,8 +790,10 @@ func main() { fmt.Println(description[i]) } - FighterAndShieldCost(data, dims, table, best) - EndEdensCost(data, dims, table, best) - VisitCost(data, dims, table, best) - EndLocationCost(data, dims, table, best) + if *extra_stats { + FighterAndShieldCost(data, dims, table, best) + EndEdensCost(data, dims, table, best) + VisitCost(data, dims, table, best) + EndLocationCost(data, dims, table, best) + } }