def place_armies(self, numarmies, sim):
#return self.pregame_place(numarmies, sim) # STUPID
owned = sim.owns[self]
stronghold = max(graph_funcs.regions(owned, sim.edgelist), key=len)
stronghold = graph_funcs.inner_border(stronghold, sim.edgelist)
def summator(x):
edges = filter(lambda i: sim.countries[i] != self, sim.edgelist[x])
return sum(map(lambda i: sim.armies[i], edges))
threatened = map(lambda i: (i,summator(i)), stronghold)
coolest = max(threatened, key=lambda i: i[1])
return {coolest[0]: numarmies}
def attack(self, sim): self.sim = sim owned = sim.owns[self] if len(owned) == 0: # Uh... we don't own anything... return None # Find the largest cluster of countries that we own stronghold = max(graph_funcs.regions(owned, sim.edgelist), key=len) scorez = [] for country in graph_funcs.inner_border(stronghold, sim.edgelist): # We don't have enough dudes to attack from this country # Retreat!!!! if self.army_size(country) < 2: continue # Retrieve a list of neighboring countries neighbors = sim.edgelist[country] neighbors = filter(lambda c: sim.countries[c] != self, neighbors) neighbors = sorted(neighbors, key=lambda i: sim.armies[i]) if len(neighbors) == 0: continue for neighbor in neighbors: #patch = sim.model.full_cdf() #chancetowin = mathmodel.integral2d(patch, lambda a1,a2: a1 > 0) # LOL there's a function for that LOL score = self.mm.chance_to_win(sim.armies[country], sim.armies[neighbor]) scorez += [(country, neighbor, score)] # print country,neighbors # print scorez #raw_input() if len(scorez) > 0: victim = sorted(scorez, key = lambda i: i[2]).pop() return (victim[0], victim[1], sim.armies[victim[0]] - 1) # print "Done" #raw_input() return None
