X-Git-Url: http://git.scottworley.com/planeteer/blobdiff_plain/c45c1bcae7063b858bfa08a2376efe3a87b2c7f2..544108c4d2c99c98bdf7566a23e5996127c8fe8e:/planeteer.go diff --git a/planeteer.go b/planeteer.go index 25c9e03..c6a309c 100644 --- a/planeteer.go +++ b/planeteer.go @@ -26,16 +26,18 @@ import "strings" var start = flag.String("start", "", "The planet to start at") +var flight_plan = flag.String("flight_plan", "", + "Your hidey-holes for the day, comma-separated.") + var end = flag.String("end", "", - "A comma-separated list of planets to end at") + "A comma-separated list of acceptable ending planets.") var planet_data_file = flag.String("planet_data_file", "planet-data", "The file to read planet data from") -var fuel = flag.Int("fuel", 16, - "Reactor units; How many non-Eden jumps we can make " + - "(but remember that deviating from the flight plan " + - "costs two units of fuel per jump)") +var fuel = flag.Int("fuel", 16, "Reactor units") + +var hold = flag.Int("hold", 300, "Size of your cargo hold") var start_edens = flag.Int("start_edens", 0, "How many Eden Warp Units are you starting with?") @@ -46,11 +48,9 @@ var end_edens = flag.Int("end_edens", 0, var cloak = flag.Bool("cloak", false, "Make sure to end with a Device of Cloaking") -var drones = flag.Int("drones", 0, - "Buy this many Fighter Drones") +var drones = flag.Int("drones", 0, "Buy this many Fighter Drones") -var batteries = flag.Int("batteries", 0, - "Buy this many Shield Batterys") +var batteries = flag.Int("batteries", 0, "Buy this many Shield Batterys") var visit_string = flag.String("visit", "", "A comma-separated list of planets to make sure to visit") @@ -68,12 +68,13 @@ type Planet struct { BeaconOn bool /* Use relative prices rather than absolute prices because you can get relative prices without traveling to each planet. */ - RelativePrices map [string] int + RelativePrices map[string]int } type planet_data struct { - Commodities map [string] Commodity - Planets map [string] Planet - pi, ci map [string] int // Generated; not read from file + Commodities map[string]Commodity + Planets map[string]Planet + p2i, c2i map[string]int // Generated; not read from file + i2p, i2c []string // Generated; not read from file } func ReadData() (data planet_data) { @@ -107,45 +108,59 @@ func ReadData() (data planet_data) { * Note that the sizes of each dimension are data driven. Many dimensions * collapse to one possible value (ie, disappear) if the corresponding * feature is not enabled. + * + * The order of the dimensions in the list of constants below determines + * their layout in RAM. The cargo-based 'dimensions' are not completely + * 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, prevent the memory manager + * from allocating pages for these areas at all. */ // The official list of dimensions: const ( - // Name Num Size Description - Edens = iota // 1 3 # of Eden warp units (0 - 2 typically) - Cloaks // 2 2 # of Devices of Cloaking (0 or 1) - UnusedCargo // 3 4 # of unused cargo spaces (0 - 3 typically) - Fuel // 4 17 Reactor power left (0 - 16) - Location // 5 26 Location (which planet) - Hold // 6 15 Cargo bay contents (a *Commodity or nil) - NeedFighters // 7 2 Errand: Buy fighter drones (needed or not) - NeedShields // 8 2 Errand: Buy shield batteries (needed or not) - Visit // 9 2**N Visit: Stop by these N planets in the route + // Name Num Size Description + Edens = iota // 1 3 # of Eden warp units (0 - 2 typically) + Cloaks // 2 2 # of Devices of Cloaking (0 or 1) + UnusedCargo // 3 4 # of unused cargo spaces (0 - 3 typically) + Fuel // 4 17 Reactor power left (0 - 16) + Location // 5 26 Location (which planet) + Hold // 6 15 Cargo bay contents (a *Commodity or nil) + NeedFighters // 7 2 Errand: Buy fighter drones (needed or not) + NeedShields // 8 2 Errand: Buy shield batteries (needed or not) + Visit // 9 2**N Visit: Stop by these N planets in the route NumDimensions ) func bint(b bool) int { - if b { return 1 } + if b { + return 1 + } return 0 } func DimensionSizes(data planet_data) []int { eden_capacity := data.Commodities["Eden Warp Units"].Limit cloak_capacity := bint(*cloak) - dims := []int{ - eden_capacity + 1, - cloak_capacity + 1, - eden_capacity + cloak_capacity + 1, - *fuel + 1, - len(data.Planets), - len(data.Commodities), - bint(*drones > 0) + 1, - bint(*batteries > 0) + 1, - 1 << uint(len(visit())), - } - if len(dims) != NumDimensions { - panic("Dimensionality mismatch") + dims := make([]int, NumDimensions) + dims[Edens] = eden_capacity + 1 + dims[Cloaks] = cloak_capacity + 1 + dims[UnusedCargo] = eden_capacity + cloak_capacity + 1 + dims[Fuel] = *fuel + 1 + dims[Location] = len(data.Planets) + dims[Hold] = len(data.Commodities) + dims[NeedFighters] = bint(*drones > 0) + 1 + dims[NeedShields] = bint(*batteries > 0) + 1 + dims[Visit] = 1 << uint(len(visit())) + + // Remind myself to add a line above when adding new dimensions + for i, dim := range dims { + if dim < 1 { + panic(i) + } } return dims } @@ -159,17 +174,13 @@ func StateTableSize(dims []int) int { } type State struct { - funds, from int -} - -func NewStateTable(dims []int) []State { - return make([]State, StateTableSize(dims)) + value, from int } func EncodeIndex(dims, addr []int) int { index := addr[0] for i := 1; i < len(dims); i++ { - index = index * dims[i] + addr[i] + index = index*dims[i] + addr[i] } return index } @@ -184,12 +195,120 @@ func DecodeIndex(dims []int, index int) []int { return addr } +/* Fill in the cell at address addr by looking at all the possible ways + * to reach this cell and selecting the best one. + * + * The other obvious implementation choice is to do this the other way + * around -- for each cell, conditionally overwrite all the other cells + * that are reachable *from* the considered cell. We choose gathering + * reads over scattering writes to avoid having to take a bunch of locks. + * + * The order that we check things here matters only for value ties. We + * keep the first best path. So when action order doesn't matter, the + * check that is performed first here will appear in the output first. + */ +func FillStateTableCell(data planet_data, dims []int, table []State, addr []int) { + /* Travel here via jumping */ + /* Travel here via Eden Warp Unit */ + /* Silly: Dump Eden warp units */ + /* Buy Eden warp units */ + /* Buy a Device of Cloaking */ + /* Silly: Dump a Device of Cloaking */ + /* Buy Fighter Drones */ + /* Buy Shield Batteries */ + if addr[Hold] == 0 { + /* Sell or dump things */ + for commodity := range data.Commodities { + } + } else { + /* Buy this thing */ + } + /* Visit this planet */ +} + +func FillStateTable2(data planet_data, dims []int, table []State, +fuel_remaining, edens_remaining int, planet string, barrier chan<- bool) { + /* The dimension nesting order up to this point is important. + * Beyond this point, it's not important. + * + * It is very important when iterating through the Hold dimension + * to visit the null commodity (empty hold) first. Visiting the + * null commodity represents selling. Visiting it first gets the + * action order correct: arrive, sell, buy, leave. Visiting the + * null commodity after another commodity would evaluate the action + * sequence: arrive, buy, sell, leave. This is a useless action + * sequence. Because we visit the null commodity first, we do not + * consider these action sequences. + */ + eden_capacity := data.Commodities["Eden Warp Units"].Limit + addr := make([]int, len(dims)) + addr[Edens] = edens_remaining + addr[Fuel] = fuel_remaining + addr[Location] = data.p2i[planet] + for addr[Hold] = 0; addr[Hold] < dims[Hold]; addr[Hold]++ { + for addr[Cloaks] = 0; addr[Cloaks] < dims[Cloaks]; addr[Cloaks]++ { + for addr[UnusedCargo] = 0; addr[UnusedCargo] < dims[UnusedCargo]; addr[UnusedCargo]++ { + if addr[Edens]+addr[Cloaks]+addr[UnusedCargo] <= + eden_capacity+1 { + for addr[NeedFighters] = 0; addr[NeedFighters] < dims[NeedFighters]; addr[NeedFighters]++ { + for addr[NeedShields] = 0; addr[NeedShields] < dims[NeedShields]; addr[NeedShields]++ { + for addr[Visit] = 0; addr[Visit] < dims[Visit]; addr[Visit]++ { + FillStateTableCell(data, dims, table, addr) + } + } + } + } + } + } + } + barrier <- true +} + +/* Filling the state table is a set of nested for loops NumDimensions deep. + * We split this into two procedures: 1 and 2. #1 is the outer, slowest- + * changing indexes. #1 fires off many calls to #2 that run in parallel. + * The order of the nesting of the dimensions, the order of iteration within + * each dimension, and where the 1 / 2 split is placed are carefully chosen + * to make this arrangement safe. + * + * Outermost two layers: Go from high-energy states (lots of fuel, edens) to + * low-energy state. These must be processed sequentially and in this order + * because you travel through high-energy states to get to the low-energy + * states. + * + * Third layer: Planet. This is a good layer to parallelize on. There's + * high enough cardinality that we don't have to mess with parallelizing + * multiple layers for good utilization (on 2011 machines). Each thread + * works on one planet's states and need not synchronize with peer threads. + */ +func FillStateTable1(data planet_data, dims []int) []State { + table := make([]State, StateTableSize(dims)) + barrier := make(chan bool, len(data.Planets)) + eden_capacity := data.Commodities["Eden Warp Units"].Limit + work_units := (float64(*fuel) + 1) * (float64(eden_capacity) + 1) + work_done := 0.0 + for fuel_remaining := *fuel; fuel_remaining >= 0; fuel_remaining-- { + for edens_remaining := eden_capacity; edens_remaining >= 0; edens_remaining-- { + for planet := range data.Planets { + go FillStateTable2(data, dims, table, fuel_remaining, + edens_remaining, planet, barrier) + } + for _ = range data.Planets { + <-barrier + } + work_done++ + fmt.Printf("\r%3.0f%%", 100*work_done/work_units) + } + } + return table +} + /* What is the value of hauling 'commodity' from 'from' to 'to'? * Take into account the available funds and the available cargo space. */ func TradeValue(data planet_data, - from, to Planet, - commodity string, - initial_funds, max_quantity int) int { +from, to Planet, +commodity string, +initial_funds, max_quantity int) int { if !data.Commodities[commodity].CanSell { return 0 } @@ -219,7 +338,7 @@ func FindBestTrades(data planet_data) [][]string { // TODO: We can't cache this because this can change based on available funds. best := make([][]string, len(data.Planets)) for from := range data.Planets { - best[data.pi[from]] = make([]string, len(data.Planets)) + best[data.p2i[from]] = make([]string, len(data.Planets)) for to := range data.Planets { best_gain := 0 price_list := data.Planets[from].RelativePrices @@ -228,13 +347,13 @@ func FindBestTrades(data planet_data) [][]string { } for commodity := range price_list { gain := TradeValue(data, - data.Planets[from], - data.Planets[to], - commodity, - 10000000, - 1) + data.Planets[from], + data.Planets[to], + commodity, + 10000000, + 1) if gain > best_gain { - best[data.pi[from]][data.pi[to]] = commodity + best[data.p2i[from]][data.p2i[to]] = commodity gain = best_gain } } @@ -244,40 +363,44 @@ func FindBestTrades(data planet_data) [][]string { } // (Example of a use case for generics in Go) -func IndexPlanets(m *map [string] Planet) map [string] int { - index := make(map [string] int, len(*m)) - i := 0 +func IndexPlanets(m *map[string]Planet, start_at int) (map[string]int, []string) { + e2i := make(map[string]int, len(*m)+start_at) + i2e := make([]string, len(*m)+start_at) + i := start_at for e := range *m { - index[e] = i + e2i[e] = i + i2e[i] = e i++ } - return index + return e2i, i2e } -func IndexCommodities(m *map [string] Commodity) map [string] int { - index := make(map [string] int, len(*m)) - i := 0 +func IndexCommodities(m *map[string]Commodity, start_at int) (map[string]int, []string) { + e2i := make(map[string]int, len(*m)+start_at) + i2e := make([]string, len(*m)+start_at) + i := start_at for e := range *m { - index[e] = i + e2i[e] = i + i2e[i] = e i++ } - return index + return e2i, i2e } func main() { flag.Parse() data := ReadData() - data.pi = IndexPlanets(&data.Planets) - data.ci = IndexCommodities(&data.Commodities) + data.p2i, data.i2p = IndexPlanets(&data.Planets, 0) + data.c2i, data.i2c = IndexCommodities(&data.Commodities, 1) dims := DimensionSizes(data) - table := NewStateTable(dims) - table[0] = State{ 1, 1 } + table := FillStateTable1(data, dims) + table[0] = State{1, 1} best_trades := FindBestTrades(data) for from := range data.Planets { for to := range data.Planets { best_trade := "(nothing)" - if best_trades[data.pi[from]][data.pi[to]] != "" { - best_trade = best_trades[data.pi[from]][data.pi[to]] + if best_trades[data.p2i[from]][data.p2i[to]] != "" { + best_trade = best_trades[data.p2i[from]][data.p2i[to]] } fmt.Printf("%s to %s: %s\n", from, to, best_trade) }