Fills in map based on the serialized game state so that self.game_map[x,y] is a list of GameUnits at that location. state_line is the

Compare two tiles and return True if the unit would rather move to the new one

Given the current location and adjacent locations, return the best 'next step' for a given unit to take

Once all nodes are validated, and a target is found, the unit can path to its target

Finds the most ideal tile in our 'pocket' of pathable space. The edge if it is available, or the best self destruct location otherwi

Prints a number between 100 and -10 in 3 spaces

Breadth first search of the grid, setting the pathlengths of each node

Attempts to upgrade units in the given locations. Args: locations: A single location or list of locations to upgrade units at

Build basic defenses using hardcoded locations. Remember to defend corners and avoid placing units in the front where enemy demolishe

This function builds reactive defenses based on where the enemy scored on us from. We can track where the opponent scored by looking

* Returns a function to use in pseudos for buttons * @param {String} type

* Returns a function to use in pseudos for input types * @param {String} type

Build a line of the cheapest stationary unit so our demolisher can attack from long range.

Gets the path a unit at a given location would take. If final point is not on an edge, it is a self destruct path Args:

Gets input from stdin

Gets all of the edges and their edge locations Returns: A list with four lists inside of it of locations corresponding to the fou

Gets the target edge given a starting location Args: start_location: The location of a hypothetical unit Returns:

Checks if the given location is inside the diamond shaped game board. Args: * location: A map location Returns: True if the location is on

Initializes the map Args: game_state: A GameState object representing the gamestate we want to traverse

This function will help us guess which location is the safest to spawn moving units from. It gets the path the unit will take then ch

Finds the path a unit would take to reach a set of endpoints Args: * start_point: The starting location of the unit *

The number of units of a given type we can afford Args: unit_type: A unit type, SCOUT, WALL, etc. Returns: T

After each deploy phase, the game engine will run the action phase of the round. The action phase is made up of a sequence of distinc

This function is called once at the start of the game. By default, it just initializes the config. \n You can override it it

This step function is called at the start of each turn. It is passed the current game state, which can be used to initiate a new Game