Uses of Interface
gametree.IGamePosition

Packages that use IGamePosition

Package	Description
algorithm	Search techniques based on B* and various utility classes used primarily by these search techniques.
experiment	Experiment classes which run individual experiments, as performed for the thesis, and the utility classes used by these experiments.
gametree	Various classes for storing and generating game trees for the use by algorithms and tree visualisation.
test	Various unit tests for maintaining basic functionality of several classes in other packages.

Uses of IGamePosition in algorithm

Classes in algorithm with type parameters of type IGamePosition

Modifier and Type	Class	Description
static class	BstarSquaredDB.L1Position<P extends IGamePosition<P>>
static class	BstarSquaredSimple.L1Position<P extends IGamePosition<P>>
static class	BstarSquaredSimpleMax.L1Position<P extends IGamePosition<P>>
static class	BstarSquaredVariant.L1Position<P extends IGamePosition<P>>	Deprecated.
static final record	SearchAlgorithm.SearchResult<N extends GameTreeNode<N,P>, P extends IGamePosition<P>>	Encapsulates the results and metrics captured from an adversarial tree search.

Classes in algorithm that implement IGamePosition

Modifier and Type	Class	Description
static class	BstarSquaredDB.L1Position<P extends IGamePosition<P>>
static class	BstarSquaredSimple.L1Position<P extends IGamePosition<P>>
static class	BstarSquaredSimpleMax.L1Position<P extends IGamePosition<P>>
static class	BstarSquaredVariant.L1Position<P extends IGamePosition<P>>	Deprecated.

Fields in algorithm declared as IGamePosition

Modifier and Type	Field	Description
(package private) final P	BstarSquaredDB.L1Position.original
(package private) final P	BstarSquaredSimple.L1Position.original
(package private) final P	BstarSquaredSimpleMax.L1Position.original
(package private) final P	BstarSquaredVariant.L1Position.original

Methods in algorithm with type parameters of type IGamePosition

Modifier and Type	Method	Description
static <N extends GameTreeNode<N,P>, P extends IGamePosition<P>> void	SearchAlgorithm.expand_tree_simple(N node, int depth, MetricKeeper... metrics)	Expands the search tree without stopping condition.
<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>> N	BstarBasic.selectNext(N current, boolean provebest, MetricKeeper... metrics)
<N extends GameTreeNode<N,P>, P extends IGamePosition<P>> N	BstarBasicDB.selectNext(N current, boolean provebest, MetricKeeper... metrics)
<N extends GameTreeNode<N,P>, P extends IGamePosition<P>> N	BstarBasicDB.selectNextDB(N current, double low, double high, MetricKeeper... metrics)

Uses of IGamePosition in experiment

Methods in experiment with type parameters of type IGamePosition

Modifier and Type	Method	Description
static <P extends IGamePosition<P>> TestDfBstar.Result	TestDfBstar.sweep(P root, Supplier<StrategyFunction> sf, int TTsize, Duration time_limit)

Uses of IGamePosition in gametree

Classes in gametree with type parameters of type IGamePosition

Modifier and Type	Class	Description
class	DepthFirstNode<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 class	DepthFirstNode.RootDFNode<P extends IGamePosition<P>>	An optional variant of the DepthFirstNode which stores the nodes at depth 1 in memory.
class	GameTreeNode<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 through GameTreeNode.children(MetricKeeper...) and GameTreeNode.parent() relations.
static final record	GameTreeNode.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).
interface	IGamePosition<P extends IGamePosition<P>>	This interface represents a game position in any game which can be modelled as an adversarial or non-adversarial game.
class	ResultTreeNode<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.
class	ResultTreeNode<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.
class	SearchTreeNode<P extends IGamePosition<P>>	Implementation of GameTreeNode that stores all nodes directly in memory.

Classes in gametree that implement IGamePosition

Modifier and Type	Class	Description
class	ArtificialGamePosition	Represents a game position in an artificial game tree.
class	VariantAGP	Represents a game position in a variant artificial game tree.

Methods in gametree with type parameters of type IGamePosition

Modifier and Type	Method	Description
static <N extends GameTreeNode<N,P>, P extends IGamePosition<P>> boolean	GameTreeNode.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 the maximizing and by_optimistic flags.
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 the saveRootChildren parameter.
static <P extends IGamePosition<P>> SearchTreeNode<P>	SearchTreeNode.getTree(P start_position)
static <P extends IGamePosition<P>> SearchTreeNode<P>	SearchTreeNode.getTree(P start_position, boolean prune_positions, boolean prune_irrelevance)
static <P extends IGamePosition<P>> SearchTreeNode<P>	SearchTreeNode.getTree(P start_position, boolean prune_positions, long minimum_depth_to_prune_positions, boolean prune_irrelevance, long minimum_depth_to_prune_irrelevance)
static <P extends IGamePosition<P>> SearchTreeNode<P>	SearchTreeNode.getTree(P start_position, boolean prune_positions, long minimum_depth_to_prune_positions, boolean prune_irrelevance, long minimum_depth_to_prune_irrelevance, boolean incorrect_bounds_protection_for_irrelevance_pruning)
static <P extends IGamePosition<P>> SearchTreeNode<P>	SearchTreeNode.getTree(P start_position, long minimum_depth_to_prune_positions, long minimum_depth_to_prune_irrelevance)
static <N extends GameTreeNode<N,P>, P extends IGamePosition<P>> GameTreeNode.Result<N,P>	GameTreeNode.leastPessimistic2(Collection<N> children, boolean maximising, MetricKeeper... metrics)	Same as GameTreeNode.findBest2(Collection, boolean, boolean, MetricKeeper...) where by_optimistic is assumed false.
static <N extends GameTreeNode<N,P>, P extends IGamePosition<P>> GameTreeNode.Result<N,P>	GameTreeNode.mostOptimistic2(Collection<N> children, boolean maximising, MetricKeeper... metrics)	Same as GameTreeNode.findBest2(Collection, boolean, boolean, MetricKeeper...) where by_optimistic is assumed true.
static <N extends GameTreeNode<N,P>, P extends IGamePosition<P>> boolean	GameTreeNode.separation(GameTreeNode<?,?> n, MetricKeeper... metrics)
static <N extends GameTreeNode<N,P>, P extends IGamePosition<P>> boolean	GameTreeNode.separation(Collection<N> children, boolean maximising, MetricKeeper... metrics)

Uses of IGamePosition in test

Classes in test with type parameters of type IGamePosition

Modifier and Type	Class	Description
class	SimpleNode<P extends IGamePosition<P>>	Implementation of GameTreeNode that only acts as a facade for the underlying tree expressed by the P implementation of IGamePosition.

Classes in test that implement IGamePosition

Modifier and Type	Class	Description
class	SimplePosition	A basic implementation of IGamePosition which allows for adding of children to the tree and setting their values.