the class that defines how this space interacts with Tokens.
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
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
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
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
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 token that is moving from this space to everywhere
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 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 set of all spaces that can be reached from this by moving into an adjacentTile using movementCost or less
A com.rayrobdod.boardGame.Space in a rectangular board, such that it can have zero or one bordering space in each of the four cardinal directions.
Ecludian geometery says that
this.left.right == this
, similarly for each other direction, but this makes no specific checks to that effect.2013 Aug 06 - Apparently 'Future' in scala means 'there's a thing that I will want in the future', not 'there's a thing that will become availiable in the futrue'. Either way, scala.parellel.Future no longer exists, as of Scala 2.11. Using
scala.Function0
instead.com.rayrobdod.boardGame.RectangularField