Index

A B C D E F G H I K L M N O P R S T U V W _
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form

G

gametree - package gametree

Various classes for storing and generating game trees for the use by algorithms and tree visualisation.

GameTreeNode<N,P> - Class in gametree

This class represents an abstract GameTreeNode which stores game positions of a game tree along with the structure of the tree itself through GameTreeNode.children(MetricKeeper...) and GameTreeNode.parent() relations.

GameTreeNode(N, P, MetricKeeper...) - Constructor for class gametree.GameTreeNode

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.

GameTreeNode.Result<N,P> - Record Class in gametree

A record to hold the two best nodes (and their indices in the original collection).

generate(Random, int, int, long) - Method in interface gametree.Generator.Width

Generates a random branching factor for one node given the provided parameters.

generate(Random, S) - Method in interface gametree.Generator

Generate the output value of type T with the random number generator r and the input params of type S.

generateBerlinerExamples(boolean, String) - Static method in class visualizer.GenerateBerlinerTreeFigures

GenerateBerlinerTreeFigures - Class in visualizer

Generates the tree figures included in the thesis.

GenerateBerlinerTreeFigures() - Constructor for class visualizer.GenerateBerlinerTreeFigures

Generator<T,S> - Interface in gametree

A generator for customising the tree structure of artificial game trees made with the VariantAGP class.

Generator.Bounds - Interface in gametree

The generator type specifically used for generating the bounds of the children generated as the children of each node of a VariantAGP artificial game tree.

Generator.Width - Interface in gametree

The generator type specifically used for generating the variable branching factor at each node of a VariantAGP artificial game tree.

getAllLeafnodes(int, Predicate<N>, MetricKeeper...) - Method in class gametree.GameTreeNode

getAlreadyComputedRuns(long[][], String[][][], boolean, boolean, boolean, String...) - Static method in class experiment.CompareAlgorithms

getAlreadyComputedRuns(String[], long[][], String[][][], boolean, boolean, boolean) - Static method in class experiment.CompareAlgorithms

Reads from a file or set of files and recovers which runs have previously been completed so they can be skipped.

getAlreadyComputedRuns(String, long[][], String[][][], boolean, boolean, boolean) - Static method in class experiment.CompareAlgorithms

getAlreadyComputedRuns(String, String, long[][], String[][][], boolean, boolean, boolean) - Static method in class experiment.CompareAlgorithms

getAlreadyComputedRuns(String, String, String, long[][], String[][][], boolean, boolean, boolean) - Static method in class experiment.CompareAlgorithms

getAttachedMetrics() - Method in class gametree.GameTreeNode

getComparator(boolean, boolean, MetricKeeper...) - Static method in class gametree.GameTreeNode

This method gives a comparator for GameTreeNode objects from the perspective of a parent node.

getCurrent() - Method in class visualizer.TextExplorer

getHeuristicStrategyFunction(int, boolean, StrategyFunction.HeuristicFunction, StrategyFunction.HeuristicFunction) - Static method in interface algorithm.StrategyFunction

If the sum of the restNodesFunction values for the alternatives is less than the bestNodeFunction value for the best node, then use DISPROVEREST; otherwise use PROVEBEST.

getIntFromSplit(String[]) - Method in class visualizer.TextExplorer

getKey(long) - Method in class algorithm.Table

getLimit() - Method in class algorithm.BstarSquaredDB.L1Position

getLimit() - Method in class algorithm.BstarSquaredSimple.L1Position

getLimit() - Method in class algorithm.BstarSquaredSimpleMax.L1Position

getLimit() - Method in class algorithm.BstarSquaredVariant.L1Position

Deprecated.

getMetrics() - Method in class algorithm.Table

getMetrics() - Method in class visualizer.TextExplorer

getRoot() - Method in class visualizer.TextExplorer

getSavedLeafnodes(int, Predicate<N>) - Method in class gametree.GameTreeNode

getTable() - Static method in class algorithm.Table

getTable(int) - Static method in class algorithm.Table

getTable(SearchAlgorithm.Limits) - Static method in class algorithm.Table

getTree() - Method in class gametree.ArtificialGamePosition.Settings

Creates a new ArtificialGamePosition object representing a unique tree defined by the parameters set in this ArtificialGamePosition.Settings object.

getTree() - Method in class gametree.VariantAGP.Settings

Creates a new VariantAGP object representing a unique tree defined by the parameters set in this VariantAGP.Settings object.

getTree(P) - Static method in class gametree.SearchTreeNode

getTree(P, boolean, boolean) - Static method in class gametree.SearchTreeNode

getTree(P, boolean, long, boolean, long) - Static method in class gametree.SearchTreeNode

getTree(P, boolean, long, boolean, long, boolean) - Static method in class gametree.SearchTreeNode

getTree(P, boolean, MetricKeeper...) - Static method in class gametree.DepthFirstNode

Get a new depth-first game tree based on the provided game position and the saveRootChildren parameter.

getTree(P, long, long) - Static method in class gametree.SearchTreeNode

getTrees(Boolean[], Integer[], Generator.Width[], Long[], Generator.Bounds[], Double[], Double[], LongSupplier) - Static method in class experiment.CompareAlgorithms

Generates a stream of variant artificial game trees for all combinations of the provided parameters, using a supplied seed for each tree.

getTrees(Boolean[], Integer[], Long[], Integer[], Double[], Double[], long) - Static method in class experiment.CompareAlgorithms

Generates a stream of artificial game trees for all combinations of the provided parameters, using a random seed for each tree generated from the given initial seed.

getTrees(Boolean[], Integer[], Long[], Integer[], Double[], Double[], Long[]) - Static method in class experiment.CompareAlgorithms

Generates a stream of artificial game trees for all combinations of the provided parameters, for each seed in the given array.

getTrees(Boolean[], Integer[], Long[], Integer[], Double[], Double[], LongSupplier) - Static method in class experiment.CompareAlgorithms

Generates a stream of artificial game trees for all combinations of the provided parameters, using a supplied seed for each tree.

greaterOrEqual(double[], int, int) - Static method in class utils.Probability

greaterOrEqualFromCDF(double[], int, int) - Static method in class utils.Probability

growth_factor - Variable in class gametree.ArtificialGamePosition.Settings

Parameter g, growth factor, always > 0, typically >= 1, dictates how much child bounds may maximally diverge from their parents' bounds in a single generation, as a factor of the parent's range: |Upper - Lower|.

growth_factor - Variable in class gametree.VariantAGP.Settings

Parameter g, growth factor, always > 0, typically >= 1, dictates how much child bounds may maximally diverge from their parents' bounds in a single generation, as a factor of the parent's range: |Upper - Lower|.

A B C D E F G H I K L M N O P R S T U V W _
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form