Uses of Interface
algorithm.SearchAlgorithm

Packages that use SearchAlgorithm

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.

Uses of SearchAlgorithm in algorithm

Subinterfaces of SearchAlgorithm in algorithm

Modifier and Type	Interface	Description
static interface	SearchAlgorithm.SearchWithTable	This represents a search algorithm which primarily stores search results in a transposition table.
static interface	SearchAlgorithm.SearchWithTree	This represents a search algorithm which can search a given tree and modify it during search.

Classes in algorithm that implement SearchAlgorithm

Modifier and Type	Class	Description
class	BstarBasic	This class implements B* with a few additional modifications: if the number of back-ups without leading back to the root reaches 1000, the algorithm is forced to back-up to the root if a terminal node is selected, the algorithm is forced to back-up to the root if the current node's best child is not its least pessimistic child, there is a 30% chance that the least pessimistic child is selected, this will not occur if this would select a terminal node
class	BstarBasicDB	Disprove-Best B*, as described in the report https://github.com/Pascalos99/ReportNewAdvancesInBstar/blob/main/Anema2025.pdf
class	BstarSquaredDB	A B*² implementation which uses Disprove-Best B* at the first-level search only.
class	BstarSquaredSimple	This implements B*²-logistic with the `dispose all' bounds preservation technique and no shallow or deep irrelevance.
class	BstarSquaredSimpleMax	This implements B*²-max with the `dispose all' bounds preservation technique and no shallow or deep irrelevance.
class	BstarSquaredVariant	Deprecated.
class	DfBstar	Deprecated.
class	DfBstar2	This is the df-B* implementation applied in the thesis.
class	DfBstar3	This implementation of df-B* with initial node selection inspired by B* Disprove-Best, but not exactly following it.
class	DfBstarDB	This implementation of df-B* applies concepts from B* Disprove-Best into the internal node selection procedure.

Uses of SearchAlgorithm in experiment

Method parameters in experiment with type arguments of type SearchAlgorithm

Modifier and Type	Method	Description
void	CompareAlgorithms.AlgoSetup.include(String name, int iterations, BiFunction<ArtificialGamePosition, Integer, SearchAlgorithm> algo_getter)
void	CompareAlgorithms.AlgoSetup.include(String name, int iterations, BiFunction<ArtificialGamePosition, Integer, SearchAlgorithm> algo_getter, Function<Integer, SearchAlgorithm.Limits> limit_func)
void	CompareAlgorithms.AlgoSetup.include(String name, int iterations, Function<ArtificialGamePosition, SearchAlgorithm> algo_getter)
void	CompareAlgorithms.AlgoSetup.include(String name, int iterations, Function<ArtificialGamePosition, SearchAlgorithm> algo_getter, Function<Integer, SearchAlgorithm.Limits> limit_func)
void	CompareAlgorithms.AlgoSetup.include(String name, int iterations, Supplier<SearchAlgorithm> algo_getter)
void	CompareAlgorithms.AlgoSetup.include(String name, int iterations, Supplier<SearchAlgorithm> algo_getter, Function<Integer, SearchAlgorithm.Limits> limit_func)
void	CompareAlgorithms.AlgoSetup.include(String name, BiFunction<ArtificialGamePosition, Integer, SearchAlgorithm> algo_getter)
void	CompareAlgorithms.AlgoSetup.include(String name, BiFunction<ArtificialGamePosition, Integer, SearchAlgorithm> algo_getter, Function<Integer, SearchAlgorithm.Limits> limit_func)
void	CompareAlgorithms.AlgoSetup.include(String name, Function<ArtificialGamePosition, SearchAlgorithm> algo_getter)
void	CompareAlgorithms.AlgoSetup.include(String name, Supplier<SearchAlgorithm> algo_getter)