Class BstarSquaredSimple.L1Position<P extends IGamePosition<P>>

java.lang.Object
algorithm.BstarSquaredSimple.L1Position<P>
All Implemented Interfaces:
IGamePosition<BstarSquaredSimple.L1Position<P>>
Enclosing class:
BstarSquaredSimple
public static class BstarSquaredSimple.L1Position<P extends IGamePosition<P>> extends Object implements IGamePosition<BstarSquaredSimple.L1Position<P>>

  • Field Details

  • Constructor Details

  • Method Details

    • getLimit

      long getLimit()

    • setTree

      public void setTree(SearchTreeNode<BstarSquaredSimple.L1Position<P>> tree)

    • evaluate

      public void evaluate()

    • next

      public Collection<BstarSquaredSimple.L1Position<P>> next()
      Specified by:
      next in interface IGamePosition<P extends IGamePosition<P>>
      Returns:
      The collection of game positions directly reachable by moves from the current player to move in this game position.

    • upperbound

      public double upperbound()
      Description copied from interface: IGamePosition
      The upper-bound value is the upper bound on the game-theoretical mini-max value of this game position.

      For the maximising player this is the best value achievable under perfect play.

      For the minimising player this is the worst-case value achievable under perfect play.

      Specified by:
      upperbound in interface IGamePosition<P extends IGamePosition<P>>
      Returns:
      The upper-bound value for this game position

    • lowerbound

      public double lowerbound()
      Description copied from interface: IGamePosition
      The lower-bound value is the lower bound on the game-theoretical mini-max value of this game position.

      For the maximising player this is the minimum value that can be guaranteed under perfect play.

      For the minimising player this is the best value achievable under perfect play.

      Specified by:
      lowerbound in interface IGamePosition<P extends IGamePosition<P>>
      Returns:
      The lower-bound value for this game position

    • depthOfUpper

      public long depthOfUpper()

    • depthOfLower

      public long depthOfLower()

    • maximising

      public boolean maximising()
      Specified by:
      maximising in interface IGamePosition<P extends IGamePosition<P>>
      Returns:
      true if the current player-to-move is maximising the score, or false if it is minimising the score.

    • hash

      public long hash()
      Description copied from interface: IGamePosition
      This method should be implemented with a hash that still remains different from similar states if a mask is applied to the hash. Commonly, a transposition table implementation may only use the first 20 to 26 bits of the hash to use as an index, so the hash should try to minimise collisions regardless of how many bits are included for the index.
      Specified by:
      hash in interface IGamePosition<P extends IGamePosition<P>>
      Returns:
      a 64-bit zobrist hash or other kind of game-state hash that represents this state.

    • toString

      public String toString()
      Overrides:
      toString in class Object