Last active
August 29, 2015 14:26
-
-
Save darenliu/13d8b1119a0a29b0377e to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
"""The ants module implements game logic for Ants Vs. SomeBees.""" | |
import random | |
import sys | |
from ucb import main, interact, trace | |
from collections import OrderedDict | |
################ | |
# Core Classes # | |
################ | |
class Place(object): | |
"""A Place holds insects and has an exit to another Place.""" | |
def __init__(self, name, exit=None): | |
"""Create a Place with the given exit. | |
name -- A string; the name of this Place. | |
exit -- The Place reached by exiting this Place (may be None). | |
""" | |
self.name = name | |
self.exit = exit | |
self.bees = [] # A list of Bees | |
self.ant = None # An Ant | |
self.entrance = None # A Place | |
# Phase 1: Add an entrance to the exit | |
# BEGIN Problem 2 | |
if self.exit is not None: | |
self.exit.entrance = self | |
# END Problem 2 | |
def add_insect(self, insect): | |
"""Add an Insect to this Place. | |
There can be at most one Ant in a Place, unless exactly one of them is | |
a BodyguardAnt (Phase 4), in which case there can be two. If add_insect | |
tries to add more Ants than is allowed, an assertion error is raised. | |
There can be any number of Bees in a Place. | |
""" | |
if insect.is_ant: | |
# Phase 4: Special handling for BodyguardAnt | |
# BEGIN Problem 7 | |
if self.ant is not None: | |
if self.ant.can_contain(insect): | |
self.ant.contain_ant(insect) | |
elif insect.can_contain(self.ant): | |
insect.contain_ant(self.ant) | |
self.ant = insect | |
else: | |
# END Problem 7 | |
assert self.ant is None, 'Two ants in {0}'.format(self) | |
self.ant = insect | |
else: | |
self.bees.append(insect) | |
insect.place = self | |
def remove_insect(self, insect): | |
"""Remove an Insect from this Place.""" | |
if not insect.is_ant: | |
self.bees.remove(insect) | |
# Handle removal if insect is contained in self.ant | |
else: | |
# Phase 4: Special handling for BodyguardAnt and QueenAnt | |
# BEGIN Problem 7 | |
if type(insect) == BodyguardAnt: | |
protected_ant = insect.ant | |
self.ant = None | |
self.ant = protected_ant | |
else: | |
self.ant = None | |
if type(insect) == QueenAnt and insect.queen_number == 1: | |
self.ant == self.ant | |
# END Problem 7 | |
insect.place = None | |
def __str__(self): | |
return self.name | |
class Insect(object): | |
"""An Insect, the base class of Ant and Bee, has armor and a Place.""" | |
is_ant = False | |
damage = 0 | |
watersafe = False | |
def __init__(self, armor, place=None): | |
"""Create an Insect with an armor amount and a starting Place.""" | |
self.armor = armor | |
self.place = place # set by Place.add_insect and Place.remove_insect | |
def reduce_armor(self, amount): | |
"""Reduce armor by amount, and remove the insect from its place if it | |
has no armor remaining. | |
>>> test_insect = Insect(5) | |
>>> test_insect.reduce_armor(2) | |
>>> test_insect.armor | |
3 | |
""" | |
self.armor -= amount | |
if self.armor <= 0: | |
self.place.remove_insect(self) | |
def action(self, colony): | |
"""The action performed each turn. | |
colony -- The AntColony, used to access game state information. | |
""" | |
def __repr__(self): | |
cname = type(self).__name__ | |
return '{0}({1}, {2})'.format(cname, self.armor, self.place) | |
class Bee(Insect): | |
"""A Bee moves from place to place, following exits and stinging ants.""" | |
name = 'Bee' | |
damage = 1 | |
watersafe = True | |
def sting(self, ant): | |
"""Attack an Ant, reducing the Ant's armor by 1.""" | |
ant.reduce_armor(self.damage) | |
def move_to(self, place): | |
"""Move from the Bee's current Place to a new Place.""" | |
self.place.remove_insect(self) | |
place.add_insect(self) | |
def blocked(self): | |
"""Return True if this Bee cannot advance to the next Place.""" | |
# Phase 3: Special handling for NinjaAnt | |
# BEGIN Problem 6A | |
if self.place.ant is None or not self.place.ant.blocks_path: | |
return False | |
return self.place.ant is not None | |
# END Problem 6A | |
def action(self, colony): | |
"""A Bee's action stings the Ant that blocks its exit if it is blocked, | |
or moves to the exit of its current place otherwise. | |
colony -- The AntColony, used to access game state information. | |
""" | |
if self.blocked(): | |
self.sting(self.place.ant) | |
elif self.armor > 0 and self.place.exit is not None: | |
self.move_to(self.place.exit) | |
class Ant(Insect): | |
"""An Ant occupies a place and does work for the colony.""" | |
container = False | |
is_ant = True | |
implemented = False # Only implemented Ant classes should be instantiated | |
food_cost = 0 | |
blocks_path = True | |
def __init__(self, armor=1): | |
"""Create an Ant with an armor quantity.""" | |
Insect.__init__(self, armor) | |
def is_ant(self): | |
return True | |
def can_contain(self, ant): | |
if self.container and self.ant is None and ant.container is False: | |
return True | |
else: | |
return False | |
class HarvesterAnt(Ant): | |
"""HarvesterAnt produces 1 additional food per turn for the colony.""" | |
name = 'Harvester' | |
implemented = True | |
food_cost = 2 | |
def action(self, colony): | |
"""Produce 1 additional food for the colony. | |
colony -- The AntColony, used to access game state information. | |
""" | |
# BEGIN Problem 1 | |
colony.food+=1 | |
# END Problem 1 | |
class ThrowerAnt(Ant): | |
"""ThrowerAnt throws a leaf each turn at the nearest Bee in its range.""" | |
name = 'Thrower' | |
implemented = True | |
damage = 1 | |
food_cost = 4 | |
min_range = 0 | |
max_range = float('inf') | |
watersafe = False | |
def nearest_bee(self, hive): | |
"""Return the nearest Bee in a Place that is not the Hive, connected to | |
the ThrowerAnt's Place by following entrances. | |
This method returns None if there is no such Bee (or none in range). | |
""" | |
# BEGIN Problem 3B | |
current_location, transition_counter = self.place, 0 | |
while current_location.entrance is not None and current_location is not hive: | |
if len(current_location.bees) > 0 and self.min_range<=transition_counter<=self.max_range: | |
return random_or_none(current_location.bees) | |
else: | |
current_location = current_location.entrance | |
transition_counter += 1 | |
return None | |
# END Problem 3B | |
def throw_at(self, target): | |
"""Throw a leaf at the target Bee, reducing its armor.""" | |
if target is not None: | |
target.reduce_armor(self.damage) | |
def action(self, colony): | |
"""Throw a leaf at the nearest Bee in range.""" | |
self.throw_at(self.nearest_bee(colony.hive)) | |
def random_or_none(s): | |
"""Return a random element of sequence s, or return None if s is empty.""" | |
if s: | |
return random.choice(s) | |
############## | |
# Extensions # | |
############## | |
class Water(Place): | |
"""Water is a place that can only hold 'watersafe' insects.""" | |
def add_insect(self, insect): | |
"""Add insect if it is watersafe, otherwise reduce its armor to 0.""" | |
# BEGIN Problem 3A | |
Place.add_insect(self, insect) | |
if not insect.watersafe: | |
insect.reduce_armor(insect.armor) | |
# END Problem 3A | |
class FireAnt(Ant): | |
"""FireAnt cooks any Bee in its Place when it expires.""" | |
name = 'Fire' | |
armor = 1 | |
# BEGIN Problem 4A | |
damage = 3 | |
food_cost = 6 | |
implemented = True # Change to True when finished, to view in GUI | |
# END Problem 4A | |
def reduce_armor(self, amount): | |
# BEGIN Problem 4A | |
self.armor-= amount | |
if self.armor <= 0: | |
for bee in self.place.bees[:]: | |
bee.reduce_armor(self.damage) | |
self.place.remove_insect(self) | |
# END Problem 4A | |
class LongThrower(ThrowerAnt): | |
"""A ThrowerAnt that only throws leaves at Bees at least 5 places away.""" | |
name = 'Long' | |
food_cost = 2 | |
armor = 1 | |
min_range = 5 | |
# BEGIN Problem 4B | |
"*** REPLACE THIS LINE ***" | |
implemented = True # Change to True when finished, to view in GUI | |
# END Problem 4B | |
class ShortThrower(ThrowerAnt): | |
"""A ThrowerAnt that only throws leaves at Bees at most 3 places away.""" | |
name = 'Short' | |
food_cost = 2 | |
armor = 1 | |
min_range = 0 | |
max_range = 3 | |
# BEGIN Problem 4B | |
"*** REPLACE THIS LINE ***" | |
implemented = True # Change to True when finished, to view in GUI | |
# END Problem 4B | |
# BEGIN Problem 5A | |
class WallAnt(Ant): | |
name = 'Wall' | |
implemented = True | |
food_cost = 4 | |
def __init__(self): | |
self.armor = 4 | |
# The WallAnt class | |
# END Problem 5A | |
class NinjaAnt(Ant): | |
"""NinjaAnt does not block the path and damages all bees in its place.""" | |
name = 'Ninja' | |
damage = 1 | |
food_cost = 6 | |
# BEGIN Problem 6A | |
blocks_path = False | |
implemented = True # Change to True when finished, to view in GUI | |
# END Problem 6A | |
def action(self, colony): | |
# BEGIN Problem 6A | |
for bee in self.place.bees[:]: | |
bee.reduce_armor(self.damage) | |
# END Problem 6A | |
# BEGIN Problem 5B | |
"*** REPLACE THIS LINE ***" | |
# The ScubaThrower class | |
class ScubaThrower(ThrowerAnt): | |
name = 'Scuba' | |
food_cost = 5 | |
armor, watersafe = 1, True | |
implemented = True | |
# END Problem 5B | |
class HungryAnt(Ant): | |
"""HungryAnt will take three turns to digest a Bee in its place. | |
While digesting, the HungryAnt can't eat another Bee. | |
""" | |
name = 'Hungry' | |
# BEGIN Problem 6B | |
food_cost = 4 | |
armor = 1 | |
time_to_digest = 3 | |
implemented = True # Change to True when finished, to view in GUI | |
# END Problem 6B | |
def __init__(self): | |
# BEGIN Problem 6B | |
self.digesting = 0 | |
Ant.__init__(self) | |
# END Problem 6B | |
def eat_bee(self, bee): | |
# BEGIN Problem 6B | |
if bee is None: | |
return None | |
self.digesting = self.time_to_digest | |
bee.reduce_armor(bee.armor) | |
# END Problem 6B | |
def action(self, colony): | |
# BEGIN Problem 6B | |
if self.digesting > 0: | |
self.digesting -= 1 | |
else: | |
random_bee = random_or_none(self.place.bees) | |
if random_bee != None: | |
self.eat_bee(random_bee) | |
self.digesting = self.time_to_digest | |
# END Problem 6B | |
class BodyguardAnt(Ant): | |
"""BodyguardAnt provides protection to other Ants.""" | |
name = 'Bodyguard' | |
container = True | |
# BEGIN Problem 7 | |
food_cost = 4 | |
armor = 2 | |
container = True | |
implemented = True # Change to True when finished, to view in GUI | |
# END Problem 7 | |
def __init__(self): | |
Ant.__init__(self, 2) | |
self.ant = None # The Ant hidden in this bodyguard | |
def contain_ant(self, ant): | |
# BEGIN Problem 7 | |
self.ant = ant | |
# END Problem 7 | |
def action(self, colony): | |
# BEGIN Problem 7 | |
if self.ant is not None: | |
self.ant.action(colony) | |
# END Problem 7 | |
class TankAnt(BodyguardAnt): | |
"""TankAnt provides both offensive and defensive capabilities.""" | |
name = 'Tank' | |
# BEGIN Problem 8 | |
"*** REPLACE THIS LINE ***" | |
implemented = False # Change to True when finished, to view in GUI | |
# END Problem 8 | |
def action(self, colony): | |
# BEGIN Problem 8 | |
"*** REPLACE THIS LINE ***" | |
# END Problem 8 | |
class QueenPlace(object): | |
"""A place that represents both places in which the bees find the queen. | |
(1) The original colony queen location at the end of all tunnels, and | |
(2) The place in which the QueenAnt resides. | |
""" | |
def __init__(self, colony_queen, ant_queen): | |
# BEGIN Problem 9 | |
self.colony_queen= colony_queen | |
self.place= ant_queen | |
# END Problem 9 | |
@property | |
def bees(self): | |
# BEGIN Problem 9 | |
return self.colony_queen.bees + self.place.bees | |
# END Problem 9 | |
class QueenAnt(ThrowerAnt): # You should change this line | |
"""The Queen of the colony. The game is over if a bee enters her place.""" | |
name = 'Queen' | |
queen_number =0 | |
food_cost = 6 | |
queen_imposter = False | |
watersafe = True | |
implemented = True | |
# Change to True when finished, to view in GUI | |
# END Problem 9 | |
def __init__(self): | |
# BEGIN Problem 9 | |
ThrowerAnt.__init__(self, 1) | |
QueenAnt.queen_number += 1 | |
self.index = self.queen_number | |
# END Problem 9 | |
def action(self, colony): | |
"""A queen ant throws a leaf, but also doubles the damage of ants | |
in her tunnel. | |
Impostor queens do only one thing: reduce their own armor to 0. | |
""" | |
# BEGIN Problem 9 | |
if self.index > 1: | |
self.reduce_armor(self.armor) | |
else: | |
ThrowerAnt.action(self, colony) | |
colony.queen = QueenPlace(colony.queen, self.place) | |
while self.place.exit: | |
if self.place.exit.ant.__class__== BodyguardAnt: | |
if self.place.exit.ant != None: #checks to see if there is ant in the place | |
self.place.exit.ant.damage = self.place.exit.ant.damage.__class__ * 2 | |
elif self.place.exit.ant != None: | |
self.place.exit.ant.damage = self.place.exit.ant.damage.__class__ * 2 | |
self.place.exit = self.place.exit.exit | |
# END Problem 9 | |
class AntRemover(Ant): | |
"""Allows the player to remove ants from the board in the GUI.""" | |
name = 'Remover' | |
implemented = False | |
def __init__(self): | |
Ant.__init__(self, 0) | |
################## | |
# Status Effects # | |
################## | |
def make_slow(action): | |
"""Return a new action method that calls action every other turn. | |
action -- An action method of some Bee | |
""" | |
# BEGIN Problem EC | |
"*** REPLACE THIS LINE ***" | |
# END Problem EC | |
def make_stun(action): | |
"""Return a new action method that does nothing. | |
action -- An action method of some Bee | |
""" | |
# BEGIN Problem EC | |
"*** REPLACE THIS LINE ***" | |
# END Problem EC | |
def apply_effect(effect, bee, duration): | |
"""Apply a status effect to a Bee that lasts for duration turns.""" | |
# BEGIN Problem EC | |
"*** REPLACE THIS LINE ***" | |
# END Problem EC | |
class SlowThrower(ThrowerAnt): | |
"""ThrowerAnt that causes Slow on Bees.""" | |
name = 'Slow' | |
# BEGIN Problem EC | |
"*** REPLACE THIS LINE ***" | |
implemented = False # Change to True when finished, to view in GUI | |
# END Problem EC | |
def throw_at(self, target): | |
if target: | |
apply_effect(make_slow, target, 3) | |
class StunThrower(ThrowerAnt): | |
"""ThrowerAnt that causes Stun on Bees.""" | |
name = 'Stun' | |
# BEGIN Problem EC | |
"*** REPLACE THIS LINE ***" | |
implemented = False # Change to True when finished, to view in GUI | |
# END Problem EC | |
def throw_at(self, target): | |
if target: | |
apply_effect(make_stun, target, 1) | |
################## | |
# Bees Extension # | |
################## | |
class Wasp(Bee): | |
"""Class of Bee that has higher damage.""" | |
name = 'Wasp' | |
damage = 2 | |
class Hornet(Bee): | |
"""Class of bee that is capable of taking two actions per turn, although | |
its overall damage output is lower. Immune to status effects. | |
""" | |
name = 'Hornet' | |
damage = 0.25 | |
def action(self, colony): | |
for i in range(2): | |
if self.armor > 0: | |
super().action(colony) | |
def __setattr__(self, name, value): | |
if name != 'action': | |
object.__setattr__(self, name, value) | |
class NinjaBee(Bee): | |
"""A Bee that cannot be blocked. Is capable of moving past all defenses to | |
assassinate the Queen. | |
""" | |
name = 'NinjaBee' | |
def blocked(self): | |
return False | |
class Boss(Wasp, Hornet): | |
"""The leader of the bees. Combines the high damage of the Wasp along with | |
status effect immunity of Hornets. Damage to the boss is capped up to 8 | |
damage by a single attack. | |
""" | |
name = 'Boss' | |
damage_cap = 8 | |
action = Wasp.action | |
def reduce_armor(self, amount): | |
super().reduce_armor(self.damage_modifier(amount)) | |
def damage_modifier(self, amount): | |
return amount * self.damage_cap/(self.damage_cap + amount) | |
class Hive(Place): | |
"""The Place from which the Bees launch their assault. | |
assault_plan -- An AssaultPlan; when & where bees enter the colony. | |
""" | |
def __init__(self, assault_plan): | |
self.name = 'Hive' | |
self.assault_plan = assault_plan | |
self.bees = [] | |
for bee in assault_plan.all_bees: | |
self.add_insect(bee) | |
# The following attributes are always None for a Hive | |
self.entrance = None | |
self.ant = None | |
self.exit = None | |
def strategy(self, colony): | |
exits = [p for p in colony.places.values() if p.entrance is self] | |
for bee in self.assault_plan.get(colony.time, []): | |
bee.move_to(random.choice(exits)) | |
colony.active_bees.append(bee) | |
class AntColony(object): | |
"""An ant collective that manages global game state and simulates time. | |
Attributes: | |
time -- elapsed time | |
food -- the colony's available food total | |
queen -- the place where the queen resides | |
places -- A list of all places in the colony (including a Hive) | |
bee_entrances -- A list of places that bees can enter | |
""" | |
def __init__(self, strategy, hive, ant_types, create_places, dimensions, food=2): | |
"""Create an AntColony for simulating a game. | |
Arguments: | |
strategy -- a function to deploy ants to places | |
hive -- a Hive full of bees | |
ant_types -- a list of ant constructors | |
create_places -- a function that creates the set of places | |
dimensions -- a pair containing the dimensions of the game layout | |
""" | |
self.time = 0 | |
self.food = food | |
self.strategy = strategy | |
self.hive = hive | |
self.ant_types = OrderedDict((a.name, a) for a in ant_types) | |
self.dimensions = dimensions | |
self.active_bees = [] | |
self.configure(hive, create_places) | |
def configure(self, hive, create_places): | |
"""Configure the places in the colony.""" | |
self.queen = Place('AntQueen') | |
self.places = OrderedDict() | |
self.bee_entrances = [] | |
def register_place(place, is_bee_entrance): | |
self.places[place.name] = place | |
if is_bee_entrance: | |
place.entrance = hive | |
self.bee_entrances.append(place) | |
register_place(self.hive, False) | |
create_places(self.queen, register_place, self.dimensions[0], self.dimensions[1]) | |
def simulate(self): | |
"""Simulate an attack on the ant colony (i.e., play the game).""" | |
num_bees = len(self.bees) | |
while len(self.queen.bees) == 0 and num_bees > 0: | |
self.hive.strategy(self) # Bees invade | |
self.strategy(self) # Ants deploy | |
for ant in self.ants: # Ants take actions | |
if ant.armor > 0: | |
ant.action(self) | |
for bee in self.active_bees[:]: # Bees take actions | |
if bee.armor > 0: | |
bee.action(self) | |
if bee.armor <= 0: | |
num_bees -= 1 | |
self.active_bees.remove(bee) | |
self.time += 1 | |
if len(self.queen.bees) > 0: | |
print('The ant queen has perished. Please try again.') | |
return False | |
else: | |
print('All bees are vanquished. You win!') | |
return True | |
def deploy_ant(self, place_name, ant_type_name): | |
"""Place an ant if enough food is available. | |
This method is called by the current strategy to deploy ants. | |
""" | |
constructor = self.ant_types[ant_type_name] | |
if self.food < constructor.food_cost: | |
print('Not enough food remains to place ' + ant_type_name) | |
else: | |
ant = constructor() | |
self.places[place_name].add_insect(ant) | |
self.food -= constructor.food_cost | |
return ant | |
def remove_ant(self, place_name): | |
"""Remove an Ant from the Colony.""" | |
place = self.places[place_name] | |
if place.ant is not None: | |
place.remove_insect(place.ant) | |
@property | |
def ants(self): | |
return [p.ant for p in self.places.values() if p.ant is not None] | |
@property | |
def bees(self): | |
return [b for p in self.places.values() for b in p.bees] | |
@property | |
def insects(self): | |
return self.ants + self.bees | |
def __str__(self): | |
status = ' (Food: {0}, Time: {1})'.format(self.food, self.time) | |
return str([str(i) for i in self.ants + self.bees]) + status | |
def ant_types(): | |
"""Return a list of all implemented Ant classes.""" | |
all_ant_types = [] | |
new_types = [Ant] | |
while new_types: | |
new_types = [t for c in new_types for t in c.__subclasses__()] | |
all_ant_types.extend(new_types) | |
return [t for t in all_ant_types if t.implemented] | |
def interactive_strategy(colony): | |
"""A strategy that starts an interactive session and lets the user make | |
changes to the colony. | |
For example, one might deploy a ThrowerAnt to the first tunnel by invoking | |
colony.deploy_ant('tunnel_0_0', 'Thrower') | |
""" | |
print('colony: ' + str(colony)) | |
msg = '<Control>-D (<Control>-Z <Enter> on Windows) completes a turn.\n' | |
interact(msg) | |
def start_with_strategy(args, strategy): | |
"""Reads command-line arguments and starts a game with those options.""" | |
import argparse | |
parser = argparse.ArgumentParser(description="Play Ants vs. SomeBees") | |
parser.add_argument('-d', type=str, metavar='DIFFICULTY', | |
help='sets difficulty of game (easy/medium/hard/insane)') | |
parser.add_argument('-w', '--water', action='store_true', | |
help='loads a full layout with water') | |
parser.add_argument('--food', type=int, | |
help='number of food to start with when testing', default=2) | |
args = parser.parse_args() | |
assault_plan = make_test_assault_plan() | |
layout = dry_layout | |
tunnel_length = 9 | |
num_tunnels = 1 | |
food = args.food | |
if args.water: | |
layout = wet_layout | |
if args.d in ['e', 'easy']: | |
assault_plan = make_easy_assault_plan() | |
num_tunnels = 2 | |
food = 2 | |
elif args.d in ['n', 'normal']: | |
assault_plan = make_normal_assault_plan() | |
num_tunnels = 3 | |
food = 2 | |
elif args.d in ['h', 'hard']: | |
assault_plan = make_hard_assault_plan() | |
num_tunnels = 4 | |
food = 2 | |
elif args.d in ['i', 'insane']: | |
assault_plan = make_insane_assault_plan() | |
num_tunnels = 4 | |
food = 2 | |
hive = Hive(assault_plan) | |
dimensions = (num_tunnels, tunnel_length) | |
return AntColony(strategy, hive, ant_types(), layout, dimensions, food).simulate() | |
########### | |
# Layouts # | |
########### | |
def wet_layout(queen, register_place, tunnels=3, length=9, moat_frequency=3): | |
"""Register a mix of wet and and dry places.""" | |
for tunnel in range(tunnels): | |
exit = queen | |
for step in range(length): | |
if moat_frequency != 0 and (step + 1) % moat_frequency == 0: | |
exit = Water('water_{0}_{1}'.format(tunnel, step), exit) | |
else: | |
exit = Place('tunnel_{0}_{1}'.format(tunnel, step), exit) | |
register_place(exit, step == length - 1) | |
def dry_layout(queen, register_place, tunnels=3, length=9): | |
"""Register dry tunnels.""" | |
wet_layout(queen, register_place, tunnels, length, 0) | |
################# | |
# Assault Plans # | |
################# | |
class AssaultPlan(dict): | |
"""The Bees' plan of attack for the Colony. Attacks come in timed waves. | |
An AssaultPlan is a dictionary from times (int) to waves (list of Bees). | |
>>> AssaultPlan().add_wave(4, 2) | |
{4: [Bee(3, None), Bee(3, None)]} | |
""" | |
def add_wave(self, bee_type, bee_armor, time, count): | |
"""Add a wave at time with count Bees that have the specified armor.""" | |
bees = [bee_type(bee_armor) for _ in range(count)] | |
self.setdefault(time, []).extend(bees) | |
return self | |
@property | |
def all_bees(self): | |
"""Place all Bees in the hive and return the list of Bees.""" | |
return [bee for wave in self.values() for bee in wave] | |
def make_test_assault_plan(): | |
return AssaultPlan().add_wave(Bee, 3, 2, 1).add_wave(Bee, 3, 3, 1) | |
def make_easy_assault_plan(): | |
plan = AssaultPlan() | |
for time in range(3, 16, 2): | |
plan.add_wave(Bee, 3, time, 1) | |
plan.add_wave(Wasp, 3, 4, 1) | |
plan.add_wave(NinjaBee, 3, 8, 1) | |
plan.add_wave(Hornet, 3, 12, 1) | |
plan.add_wave(Boss, 15, 16, 1) | |
return plan | |
def make_normal_assault_plan(): | |
plan = AssaultPlan() | |
for time in range(3, 16, 2): | |
plan.add_wave(Bee, 3, time, 2) | |
plan.add_wave(Wasp, 3, 4, 1) | |
plan.add_wave(NinjaBee, 3, 8, 1) | |
plan.add_wave(Hornet, 3, 12, 1) | |
plan.add_wave(Wasp, 3, 16, 1) | |
#Boss Stage | |
for time in range(21, 30, 2): | |
plan.add_wave(Bee, 3, time, 2) | |
plan.add_wave(Wasp, 3, 22, 2) | |
plan.add_wave(Hornet, 3, 24, 2) | |
plan.add_wave(NinjaBee, 3, 26, 2) | |
plan.add_wave(Hornet, 3, 28, 2) | |
plan.add_wave(Boss, 20, 30, 1) | |
return plan | |
def make_hard_assault_plan(): | |
plan = AssaultPlan() | |
for time in range(3, 16, 2): | |
plan.add_wave(Bee, 4, time, 2) | |
plan.add_wave(Hornet, 4, 4, 2) | |
plan.add_wave(Wasp, 4, 8, 2) | |
plan.add_wave(NinjaBee, 4, 12, 2) | |
plan.add_wave(Wasp, 4, 16, 2) | |
#Boss Stage | |
for time in range(21, 30, 2): | |
plan.add_wave(Bee, 4, time, 3) | |
plan.add_wave(Wasp, 4, 22, 2) | |
plan.add_wave(Hornet, 4, 24, 2) | |
plan.add_wave(NinjaBee, 4, 26, 2) | |
plan.add_wave(Hornet, 4, 28, 2) | |
plan.add_wave(Boss, 30, 30, 1) | |
return plan | |
def make_insane_assault_plan(): | |
plan = AssaultPlan() | |
plan.add_wave(Hornet, 5, 2, 2) | |
for time in range(3, 16, 2): | |
plan.add_wave(Bee, 5, time, 2) | |
plan.add_wave(Hornet, 5, 4, 2) | |
plan.add_wave(Wasp, 5, 8, 2) | |
plan.add_wave(NinjaBee, 5, 12, 2) | |
plan.add_wave(Wasp, 5, 16, 2) | |
#Boss Stage | |
for time in range(21, 30, 2): | |
plan.add_wave(Bee, 5, time, 3) | |
plan.add_wave(Wasp, 5, 22, 2) | |
plan.add_wave(Hornet, 5, 24, 2) | |
plan.add_wave(NinjaBee, 5, 26, 2) | |
plan.add_wave(Hornet, 5, 28, 2) | |
plan.add_wave(Boss, 30, 30, 2) | |
return plan | |
from utils import * | |
@main | |
def run(*args): | |
Insect.reduce_armor = class_method_wrapper(Insect.reduce_armor, | |
pre=print_expired_insects) | |
start_with_strategy(args, interactive_strategy) | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment