Uses of Package
gametree
Packages that use gametree
Package
Description
Search techniques based on B* and various utility classes used primarily by these search techniques.
Experiment classes which run individual experiments, as performed for the thesis, and the utility classes used by these experiments.
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.
-
ClassDescriptionThis 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...)andGameTreeNode.parent()relations.A record to hold the two best nodes (and their indices in the original collection).This interface represents a game position in any game which can be modelled as an adversarial or non-adversarial game.This class is intended for use with algorithm testing by keeping track of metrics used to evaluate different algorithms on game tree search problems.Implementation ofGameTreeNodethat stores all nodes directly in memory. -
Classes in gametree used by experimentClassDescriptionRepresents a game position in an artificial game tree.The generator type specifically used for generating the bounds of the children generated as the children of each node of a
VariantAGPartificial game tree.The generator type specifically used for generating the variable branching factor at each node of aVariantAGPartificial game tree.This interface represents a game position in any game which can be modelled as an adversarial or non-adversarial game.Represents a game position in a variant artificial game tree. -
ClassDescriptionRepresents a game position in an artificial game tree.A class that stores the settings for a
ArtificialGamePositiontree.GameTreeNode implementation that does not store children nodes, but does store the depth of bounds and the bounds themselves.This class represents an abstract GameTreeNode which stores game positions of a game tree along with the structure of the tree itself throughGameTreeNode.children(MetricKeeper...)andGameTreeNode.parent()relations.A record to hold the two best nodes (and their indices in the original collection).A generator for customising the tree structure of artificial game trees made with theVariantAGPclass.The generator type specifically used for generating the bounds of the children generated as the children of each node of aVariantAGPartificial game tree.The generator type specifically used for generating the variable branching factor at each node of aVariantAGPartificial game tree.This interface represents a game position in any game which can be modelled as an adversarial or non-adversarial game.This class is intended for use with algorithm testing by keeping track of metrics used to evaluate different algorithms on game tree search problems.Creates a tree of position type Q from a source tree with position type P with the help of a P-to-Q transformer.Implementation ofGameTreeNodethat stores all nodes directly in memory.A class that stores the settings for aSearchTreeNodetree.Represents a game position in a variant artificial game tree.A record holding the information provided toGeneratorfunctions for determining the bounds of a generated child node.A class that stores the settings for aVariantAGPtree. -
ClassDescriptionThis 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...)andGameTreeNode.parent()relations.This interface represents a game position in any game which can be modelled as an adversarial or non-adversarial game.This class is intended for use with algorithm testing by keeping track of metrics used to evaluate different algorithms on game tree search problems. -
Classes in gametree used by visualizerClassDescriptionThis 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...)andGameTreeNode.parent()relations.This class is intended for use with algorithm testing by keeping track of metrics used to evaluate different algorithms on game tree search problems.