Uses of Class
gametree.MetricKeeper
Packages that use MetricKeeper
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 MetricKeeper in algorithm
Fields in algorithm declared as MetricKeeperModifier and TypeFieldDescriptionfinal MetricKeeperBstarSquaredDB.L1Position.Settings.L1_metricsfinal MetricKeeperBstarSquaredSimple.L1Position.Settings.L1_metricsfinal MetricKeeperBstarSquaredSimpleMax.L1Position.Settings.L1_metricsfinal MetricKeeperBstarSquaredVariant.L1Position.Settings.L1_metricsfinal MetricKeeperBstarSquaredDB.L1Position.Settings.L2_metricsfinal MetricKeeperBstarSquaredSimple.L1Position.Settings.L2_metricsfinal MetricKeeperBstarSquaredSimpleMax.L1Position.Settings.L2_metricsfinal MetricKeeperBstarSquaredVariant.L1Position.Settings.L2_metricsfinal MetricKeeper[]BstarSquaredDB.L1Position.Settings.other_metricsfinal MetricKeeper[]BstarSquaredSimple.L1Position.Settings.other_metricsfinal MetricKeeper[]BstarSquaredSimpleMax.L1Position.Settings.other_metricsfinal MetricKeeper[]BstarSquaredVariant.L1Position.Settings.other_metricsfinal MetricKeeperBstarSquaredDB.L1Position.Settings.true_metricsfinal MetricKeeperBstarSquaredSimple.L1Position.Settings.true_metricsfinal MetricKeeperBstarSquaredSimpleMax.L1Position.Settings.true_metricsfinal MetricKeeperBstarSquaredVariant.L1Position.Settings.true_metricsMethods in algorithm that return MetricKeeperModifier and TypeMethodDescriptionSearchAlgorithm.SearchResult.mainMetrics()SearchAlgorithm.SearchResult.metrics()Returns the value of themetricsrecord component.Methods in algorithm with parameters of type MetricKeeperModifier and TypeMethodDescriptiondoubleStrategyFunction.HeuristicFunction.evaluate(GameTreeNode<?, ?> node, boolean maximising, MetricKeeper... metrics) static <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.booleanSearchAlgorithm.Limits.reached(MetricKeeper metrics) booleanSearchAlgorithm.Limits.reachedAll(MetricKeeper... metrics) booleanSearchAlgorithm.Limits.reachedAny(MetricKeeper... metrics) booleanSearchAlgorithm.Limits.reachedEvaluations(MetricKeeper metrics) booleanSearchAlgorithm.Limits.reachedExpansions(MetricKeeper metrics) booleanSearchAlgorithm.Limits.reachedNodes(MetricKeeper metrics) booleanSearchAlgorithm.Limits.reachedSum(MetricKeeper... metrics) <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> BstarBasic.search(P root, Duration time_limit, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> BstarBasicDB.search(P root, Duration time_limit, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> BstarSquaredDB.search(P root, Duration time_limit, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> BstarSquaredSimple.search(P root, Duration time_limit, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> BstarSquaredSimpleMax.search(P root, Duration time_limit, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> BstarSquaredVariant.search(P root, Duration time_limit, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) Deprecated.<P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> DfBstar.search(P root, Table table, Duration time_limit, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) Deprecated.<P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> DfBstar2.search(P root, Table table, Duration time_limit, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> DfBstar3.search(P root, Table table, Duration time_limit, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> DfBstarDB.search(P root, Table table, Duration time_limit, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) default <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> SearchAlgorithm.search(P root, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) Initiates the search of the provided game tree without time limits.default <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> SearchAlgorithm.search(P root, MetricKeeper... metrics) Initiates the search of the provided game tree without time or spatial limits.<P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> SearchAlgorithm.search(P 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 <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> SearchAlgorithm.search(P root, Duration time_limit, MetricKeeper... metrics) Initiates the search of the provided game tree without spatial limits.default <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> SearchAlgorithm.SearchWithTable.search(P root, Table table, SearchAlgorithm.Limits space_limit, MetricKeeper... metrics) Initiates the search of the provided game tree without time limits.default <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> SearchAlgorithm.SearchWithTable.search(P root, Table table, MetricKeeper... metrics) Initiates the search of the provided game tree without time or spatial limits.<P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> SearchAlgorithm.SearchWithTable.search(P root, Table table, 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 <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> SearchAlgorithm.SearchWithTable.search(P root, Table table, Duration time_limit, MetricKeeper... metrics) Initiates the search of the provided game tree without spatial limits.default <P extends IGamePosition<P>>
SearchAlgorithm.SearchResult<?, P> SearchAlgorithm.SearchWithTable.search(P 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.<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) booleanStopCondition.stopSearching(GameTreeNode<?, ?> node, MetricKeeper... metrics) booleanStrategyFunction.useProveBest(GameTreeNode<?, ?> root, MetricKeeper... metrics) Method parameters in algorithm with type arguments of type MetricKeeperModifier and TypeMethodDescriptionStrategyFunction.BY_SUBTREE_PARAMS(int num_alternatives, boolean by_optimistic, ToDoubleFunction<MetricKeeper> bestNodeEvaluator, ToDoubleFunction<MetricKeeper> restNodesEvaluator) Constructors in algorithm with parameters of type MetricKeeperModifierConstructorDescriptionSearchResult(N root, MetricKeeper... metrics) Creates an instance of aSearchResultrecord class.Settings(int level, Instant start, SearchAlgorithm.Limits space_limit, Duration time_limit, MetricKeeper L1_metrics, MetricKeeper L2_metrics, MetricKeeper true_metrics, MetricKeeper[] other_metrics, StrategyFunction[] strategyFunctions) Settings(int level, Instant start, SearchAlgorithm.Limits space_limit, Duration time_limit, MetricKeeper L1_metrics, MetricKeeper L2_metrics, MetricKeeper true_metrics, MetricKeeper[] other_metrics, StrategyFunction[] strategyFunctions) Settings(int level, Instant start, SearchAlgorithm.Limits space_limit, Duration time_limit, MetricKeeper L1_metrics, MetricKeeper L2_metrics, MetricKeeper true_metrics, MetricKeeper[] other_metrics, StrategyFunction[] strategyFunctions) Settings(int level, Instant start, SearchAlgorithm.Limits space_limit, Duration time_limit, MetricKeeper L1_metrics, MetricKeeper L2_metrics, MetricKeeper true_metrics, MetricKeeper[] other_metrics, StrategyFunction[] strategyFunctions) -
Uses of MetricKeeper in gametree
Methods in gametree that return MetricKeeperModifier and TypeMethodDescriptionprotected MetricKeeper[]GameTreeNode.combineMetricList(MetricKeeper... metrics) MetricKeeper.copy()Creates a copy of thisMetricKeeperwith the same metric values, but no link to this object.Creates a copy of thisMetricKeeperwith the same metric values, but no link to this object.GameTreeNode.getAttachedMetrics()Methods in gametree with parameters of type MetricKeeperModifier and TypeMethodDescriptionprotected booleanDepthFirstNode._adjustBounds(List<DepthFirstNode<P>> children, MetricKeeper... metrics) protected abstract booleanGameTreeNode._adjustBounds(List<N> children, MetricKeeper... metrics) Method to implement functionality ofGameTreeNode.adjustBounds(List<N>, MetricKeeper...).protected booleanResultTreeNode._adjustBounds(List<ResultTreeNode<N, P, Q>> children, MetricKeeper... metrics) booleanSearchTreeNode._adjustBounds(List<SearchTreeNode<P>> children, MetricKeeper... metrics) protected List<DepthFirstNode<P>> DepthFirstNode._children(MetricKeeper... metrics) DepthFirstNode.RootDFNode._children(MetricKeeper... metrics) This implementation stores the children of the root node only, only the root node will be of the typeDepthFirstNode.RootDFNode, whereas all children will be of the typeDepthFirstNodewhich does not store children in memory.GameTreeNode._children(MetricKeeper... metrics) Method to implement functionality ofGameTreeNode.children(MetricKeeper...).protected List<ResultTreeNode<N, P, Q>> ResultTreeNode._children(MetricKeeper... metrics) SearchTreeNode._children(MetricKeeper... metrics) protected longDepthFirstNode._depthOfLower(MetricKeeper... metrics) protected abstract longGameTreeNode._depthOfLower(MetricKeeper... metrics) Method to implement functionality ofGameTreeNode.depthOfLower(MetricKeeper...).protected longResultTreeNode._depthOfLower(MetricKeeper... metrics) longSearchTreeNode._depthOfLower(MetricKeeper... metrics) protected longDepthFirstNode._depthOfUpper(MetricKeeper... metrics) protected abstract longGameTreeNode._depthOfUpper(MetricKeeper... metrics) Method to implement functionality ofGameTreeNode.depthOfUpper(MetricKeeper...).protected longResultTreeNode._depthOfUpper(MetricKeeper... metrics) longSearchTreeNode._depthOfUpper(MetricKeeper... metrics) protected doubleDepthFirstNode._lowerbound(MetricKeeper... metrics) protected abstract doubleGameTreeNode._lowerbound(MetricKeeper... metrics) Method to implement functionality ofGameTreeNode.lowerbound(MetricKeeper...).protected doubleResultTreeNode._lowerbound(MetricKeeper... metrics) doubleSearchTreeNode._lowerbound(MetricKeeper... metrics) protected doubleDepthFirstNode._upperbound(MetricKeeper... metrics) protected abstract doubleGameTreeNode._upperbound(MetricKeeper... metrics) Method to implement functionality ofGameTreeNode.upperbound(MetricKeeper...).protected doubleResultTreeNode._upperbound(MetricKeeper... metrics) doubleSearchTreeNode._upperbound(MetricKeeper... metrics) static <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.booleanGameTreeNode.adjustBounds(boolean useExpansions, MetricKeeper... metrics) booleanGameTreeNode.adjustBounds(MetricKeeper... metrics) Adjusts the bounds of this node according to the values of thechildrennodes as given byGameTreeNode.children(MetricKeeper...).booleanGameTreeNode.adjustBounds(List<N> children, MetricKeeper... metrics) booleanResultTreeNode.adjustBounds(boolean useExpansions, MetricKeeper... metrics) static voidMetricKeeper.adjustNodeCount(long nodesSavedIncrease, MetricKeeper... metrics) Increases the number of nodes kept in memory of allMetricKeeperobjects provided bynodesSavedIncreasewhich may be negative.voidGameTreeNode.attachMetrics(MetricKeeper... m) voidSearchTreeNode.attachMetrics(MetricKeeper... metrics) double[]GameTreeNode.CDF(int maxDepth, MetricKeeper... metrics) Computes the Cumulative Distribution Function (CDF)P(X ≤ t)of this node, assuming that the distribution is a discrete one.GameTreeNode.children(MetricKeeper... metrics) The children of this node are its direct descendants.protected MetricKeeper[]GameTreeNode.combineMetricList(MetricKeeper... metrics) longGameTreeNode.depthOfLower(MetricKeeper... metrics) Depth-of-lowerbound is the depth from which the lower bound of this node has been backed up.longGameTreeNode.depthOfUpper(MetricKeeper... metrics) Depth-of-upperbound is the depth from which the upper bound of this node has been backed up.booleanSearchTreeNode.evaluate(MetricKeeper... metrics) Evaluates this node if the tree has not been frozen in theSearchTreeNode.settings.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.GameTreeNode.getAllLeafnodes(int maxDepth, Predicate<N> include, MetricKeeper... metrics) static Comparator<GameTreeNode<?, ?>> GameTreeNode.getComparator(boolean maximising, boolean by_optimistic, MetricKeeper... metrics) This method gives a comparator forGameTreeNodeobjects from the perspective of a parent node.static <P extends IGamePosition<P>>
DepthFirstNode<P> DepthFirstNode.getTree(P root, boolean saveRootChildren, MetricKeeper... metrics) Get a new depth-first game tree based on the provided game position and thesaveRootChildrenparameter.static voidMetricKeeper.incrementEvaluations(long evaluationsIncrement, MetricKeeper... metrics) Increments the number of evaluations of allMetricKeeperobjects provided by0orevaluationsIncrementif it is positive.static voidMetricKeeper.incrementEvaluations(MetricKeeper... metrics) Increments the number of evaluations of allMetricKeeperobjects provided by1.static voidMetricKeeper.incrementExpansions(long expansionsIncrement, MetricKeeper... metrics) Increments the number of expansions of allMetricKeeperobjects provided by0orexpansionsIncrementif it is positive.static voidMetricKeeper.incrementExpansions(MetricKeeper... metrics) Increments the number of expansions of allMetricKeeperobjects provided by1.static voidMetricKeeper.incrementMetrics(long evaluationsIncrement, long expansionsIncrement, MetricKeeper... metrics) Updates the givenMetricKeeperobjects with the supplied values to increment the evaluations and expansions counts by.booleanGameTreeNode.isRelevant(MetricKeeper... metrics) static <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
GameTreeNode.Result<N, P> GameTreeNode.leastPessimistic2(Collection<N> children, boolean maximising, MetricKeeper... metrics) Same asGameTreeNode.findBest2(Collection, boolean, boolean, MetricKeeper...)whereby_optimisticis assumedfalse.doubleGameTreeNode.lowerbound(MetricKeeper... metrics) The lower-bound value is the lower bound on the game-theoretical mini-max value of this game position.static <N extends GameTreeNode<N,P>, P extends IGamePosition<P>>
GameTreeNode.Result<N, P> GameTreeNode.mostOptimistic2(Collection<N> children, boolean maximising, MetricKeeper... metrics) Same asGameTreeNode.findBest2(Collection, boolean, boolean, MetricKeeper...)whereby_optimisticis assumedtrue.double[]GameTreeNode.PMF(int maxDepth, MetricKeeper... metrics) Computes the Probability Mass Function (PMF)P(X = x)of this node, assuming that the distribution is a discrete one.GameTreeNode.printTree(int depth, boolean toString, boolean printDist, MetricKeeper... metrics) Visually represents the structure of the sub-tree starting from this node as aString.GameTreeNode.printTree(int depth, boolean toString, MetricKeeper... metrics) Visually represents the structure of the sub-tree starting from this node as aString.GameTreeNode.printTree(int depth, MetricKeeper... metrics) booleanSearchTreeNode.pruneIrrelevantChildren(MetricKeeper[] m) doubleGameTreeNode.remainingSolveEffort(MetricKeeper... metrics) booleanGameTreeNode.Result.separation(MetricKeeper... metrics) Separation occurs when one node in a set of children is strictly better than its siblings.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) double[]GameTreeNode.survivalFunction(int maxDepth, MetricKeeper... metrics) Computes the Survival FunctionP(X ≥ x)of this node, assuming that the distribution is a discrete one.voidGameTreeNode.updateTree(MetricKeeper... metrics) doubleGameTreeNode.upperbound(MetricKeeper... metrics) The upper-bound value is the upper bound on the game-theoretical mini-max value of this gameGameTreeNode.position().Constructors in gametree with parameters of type MetricKeeperModifierConstructorDescriptionprotectedDepthFirstNode(DepthFirstNode<P> parent, P position, MetricKeeper... metrics) protectedGameTreeNode(N parent, P position, MetricKeeper... metrics) Creates a GameTreeNode in the same game tree as the given parent node, as its child node, where the given position is the current game state.MetricKeeper(String metricName, MetricKeeper m) Initialises this object with initial values equal to the current values of the givenMetricKeeperobjectm.RootDFNode(P position, MetricKeeper... metrics) SearchTreeNode(SearchTreeNode.Settings settings, SearchTreeNode<P> parent, P position, MetricKeeper... metrics) SearchTreeNode(SearchTreeNode.Settings settings, P position, MetricKeeper... metrics) -
Uses of MetricKeeper in test
Methods in test with parameters of type MetricKeeperModifier and TypeMethodDescriptionbooleanSimpleNode._adjustBounds(List<SimpleNode<P>> children, MetricKeeper... metrics) List<SimpleNode<P>> SimpleNode._children(MetricKeeper... metrics) longSimpleNode._depthOfLower(MetricKeeper... metrics) longSimpleNode._depthOfUpper(MetricKeeper... metrics) doubleSimpleNode._lowerbound(MetricKeeper... metrics) doubleSimpleNode._upperbound(MetricKeeper... metrics) -
Uses of MetricKeeper in visualizer
Methods in visualizer that return MetricKeeperMethods in visualizer with parameters of type MetricKeeperModifier and TypeMethodDescriptionvoidTextExplorer.addMetrics(MetricKeeper... metrics) voidTextExplorer.setMetrics(MetricKeeper m)