A space that is treated as adjacent to this one; such as a tile that can be directly accessed from this tile without passing through other tiles
an object that defines how this space interacts with tokens
Finds the distance between this Space and another Space.
Finds the distance between this Space and another Space. This is Dijkstra's algorithm, as the spaces aren't allowed to know where they are in relation they are to each other.
the space to find the movementCost required to get to
A function that defines the 'cost' of moving from the first space to the second space
the movementCost required to get from this space to other
Finds the shortest path from this space to another space This is Dijkstra's algorithm, as the spaces aren't allowed to know where they are in relation they are to each other.
Finds the shortest path from this space to another space This is Dijkstra's algorithm, as the spaces aren't allowed to know where they are in relation they are to each other.
This short-circuts when it finds the desired space, and so is more efficient than pathToEverywhere which searches the whole field
the space to find the movementCost required to get to
A function that defines the 'cost' of moving from the first space to the second space
the a list of spaces such that the first space is this, the last space is other, and the movementcost between the two is minimal
Returns the raw Dijkstra's algorithm data
Returns the raw Dijkstra's algorithm data
the function defining the cost to move from one space to another
A map where the key is a space, and the value is the cost from here to the key, and how to get there.
Finds all the spaces that take exactly movementCost to get To.
Finds all the spaces that take exactly movementCost to get To.
the amount of movementCost available
A function that defines the 'cost' of moving from the first space to the second space
a set of all spaces that can be reached from this by moving into an adjacentTile using exactly movementCost
Finds all the spaces within a certain movementCost of this one.
Finds all the spaces within a certain movementCost of this one.
the amount of movementCost available
A function that defines the 'cost' of moving from the first space to the second space
a set of all spaces that can be reached from this by moving into an adjacentTile using movementCost or less
A spot on a board game board
the type of spaceclass used by this class
3.0.0