Uses of Class
gametree.GameTreeNode
Packages that use GameTreeNode
Package
Description
Search techniques based on B* and various utility classes used primarily by these search techniques.
Various classes for storing and generating game trees for the use by algorithms and tree visualisation.
Various unit tests for maintaining basic functionality of several classes in other packages.
Utilitiy classes specifically for visualising game trees using the command prompt or by generating figures with XML.
-
Uses of GameTreeNode in algorithm
Classes in algorithm with type parameters of type GameTreeNodeModifier and TypeClassDescriptionstatic final recordSearchAlgorithm.SearchResult<N extends GameTreeNode<N,P>, P extends IGamePosition<P>> Encapsulates the results and metrics captured from an adversarial tree search.Methods in algorithm with type parameters of type GameTreeNodeModifier and TypeMethodDescriptionstatic <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
voidSearchAlgorithm.expand_tree_simple(N node, int depth, MetricKeeper... metrics) Expands the search tree without stopping condition.<N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<N, P> BstarBasic.searchWithTree(N root, Duration time_limit, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<N, P> BstarBasicDB.searchWithTree(N root, Duration time_limit, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) default <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<N, P> SearchAlgorithm.SearchWithTree.searchWithTree(N root, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) Initiates the search of the provided game tree without time limits.default <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<N, P> SearchAlgorithm.SearchWithTree.searchWithTree(N root, MetricKeeper... metrics) Initiates the search of the provided game tree without time or spatial limits.<N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<N, P> SearchAlgorithm.SearchWithTree.searchWithTree(N root, Duration time_limit, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) Initiates the search of the provided game tree with a given time limit and spatial limit.default <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<N, P> SearchAlgorithm.SearchWithTree.searchWithTree(N root, Duration time_limit, MetricKeeper... metrics) Initiates the search of the provided game tree without spatial limits.<N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
NBstarBasic.selectNext(N current, boolean provebest, MetricKeeper... metrics) <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
NBstarBasicDB.selectNext(N current, boolean provebest, MetricKeeper... metrics) <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
NBstarBasicDB.selectNextDB(N current, double low, double high, MetricKeeper... metrics) Methods in algorithm with parameters of type GameTreeNodeModifier and TypeMethodDescriptiondoubleStrategyFunction.HeuristicFunction.evaluate(GameTreeNode<?, ?> node, boolean maximising, MetricKeeper... metrics) booleanStopCondition.stopSearching(GameTreeNode<?, ?> node, MetricKeeper... metrics) booleanStrategyFunction.useProveBest(GameTreeNode<?, ?> root, MetricKeeper... metrics) -
Uses of GameTreeNode in gametree
Classes in gametree with type parameters of type GameTreeNodeModifier and TypeClassDescriptionclassGameTreeNode<N extends GameTreeNode<N,P>, P extends IGamePosition<P>> This class represents an abstract GameTreeNode which stores game positions of a game tree along with the structure of the tree itself throughchildren(MetricKeeper...)andparent()relations.static final recordGameTreeNode.Result<N extends GameTreeNode<N,P>, P extends IGamePosition<P>> A record to hold the two best nodes (and their indices in the original collection).classResultTreeNode<N extends GameTreeNode<N,P>, P extends IGamePosition<P>, Q extends IGamePosition<Q>> Creates a tree of position type Q from a source tree with position type P with the help of a P-to-Q transformer.Subclasses of GameTreeNode in gametreeModifier and TypeClassDescriptionclassDepthFirstNode<P extends IGamePosition<P>>GameTreeNode implementation that does not store children nodes, but does store the depth of bounds and the bounds themselves.(package private) static classDepthFirstNode.RootDFNode<P extends IGamePosition<P>>An optional variant of the DepthFirstNode which stores the nodes at depth 1 in memory.classResultTreeNode<N extends GameTreeNode<N,P>, P extends IGamePosition<P>, Q extends IGamePosition<Q>> Creates a tree of position type Q from a source tree with position type P with the help of a P-to-Q transformer.classSearchTreeNode<P extends IGamePosition<P>>Implementation ofGameTreeNodethat stores all nodes directly in memory.Fields in gametree declared as GameTreeNodeMethods in gametree with type parameters of type GameTreeNodeModifier and TypeMethodDescriptionstatic <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
booleanGameTreeNode.adjustBounds(boolean maximising, double[] lowerUpper, long[] depthLowerUpper, List<N> children, MetricKeeper... metrics) Adjust the bounds of a node.static <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
GameTreeNode.Result<N, P> GameTreeNode.findBest2(Collection<N> children, boolean maximising, boolean by_optimistic, MetricKeeper... metrics) Calculate the best 2 nodes from the perspective specified by themaximizingandby_optimisticflags.static <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
GameTreeNode.Result<N, P> GameTreeNode.leastPessimistic2(Collection<N> children, boolean maximising, MetricKeeper... metrics) Same asfindBest2(Collection, boolean, boolean, MetricKeeper...)whereby_optimisticis assumedfalse.static <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
GameTreeNode.Result<N, P> GameTreeNode.mostOptimistic2(Collection<N> children, boolean maximising, MetricKeeper... metrics) Same asfindBest2(Collection, boolean, boolean, MetricKeeper...)whereby_optimisticis assumedtrue.static <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
booleanGameTreeNode.separation(GameTreeNode<?, ?> n, MetricKeeper... metrics) static <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
booleanGameTreeNode.separation(Collection<N> children, boolean maximising, MetricKeeper... metrics) Methods in gametree that return GameTreeNodeMethods in gametree that return types with arguments of type GameTreeNodeModifier and TypeMethodDescriptionstatic Comparator<GameTreeNode<?, ?>> GameTreeNode.getComparator(boolean maximising, boolean by_optimistic, MetricKeeper... metrics) This method gives a comparator forGameTreeNodeobjects from the perspective of a parent node.Methods in gametree with parameters of type GameTreeNodeModifier and TypeMethodDescriptionstatic <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
booleanGameTreeNode.separation(GameTreeNode<?, ?> n, MetricKeeper... metrics) -
Uses of GameTreeNode in test
Subclasses of GameTreeNode in testModifier and TypeClassDescriptionclassSimpleNode<P extends IGamePosition<P>>Implementation ofGameTreeNodethat only acts as a facade for the underlying tree expressed by thePimplementation ofIGamePosition. -
Uses of GameTreeNode in visualizer
Methods in visualizer that return GameTreeNodeModifier and TypeMethodDescriptionGameTreeNode<?, ?> TextExplorer.getCurrent()GameTreeNode<?, ?> TextExplorer.getRoot()GameTreeNode<?, ?> TextExplorer.selectNode(int index) Methods in visualizer with parameters of type GameTreeNodeModifier and TypeMethodDescriptionvoidTextExplorer.setTree(GameTreeNode<?, ?> root) TreeToXML.transform(GameTreeNode<?, ?> tree, int maxDepth) TreeToXML.transform(GameTreeNode<?, ?> tree, int maxDepth, double minValue, double maxValue) Constructors in visualizer with parameters of type GameTreeNode