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

B

B_2D - Static variable in interface algorithm.StrategyFunction

Berliner's depth-based D-criterium, considering 1 alternative

B_2R - Static variable in interface algorithm.StrategyFunction

Berliner's depth- and range-based R-criterium, considering 1 alternative

B_3D - Static variable in interface algorithm.StrategyFunction

Berliner's depth-based D-criterium, considering 2 alternatives

B_3R - Static variable in interface algorithm.StrategyFunction

Berliner's depth- and range-based R-criterium, considering 2 alternatives

B_AD - Static variable in interface algorithm.StrategyFunction

Berliner's depth-based D-criterium, considering all alternatives

B_AR - Static variable in interface algorithm.StrategyFunction

Berliner's depth- and range-based R-criterium, considering all alternatives

berliner1979() - Static method in class visualizer.ExampleTrees

best() - Method in record class gametree.GameTreeNode.Result

Returns the value of the best record component.

best2index() - Method in record class gametree.GameTreeNode.Result

Returns the value of the best2index record component.

bestindex() - Method in record class gametree.GameTreeNode.Result

Returns the value of the bestindex record component.

bestMove() - Method in record class algorithm.SearchAlgorithm.SearchResult

Alias for SearchAlgorithm.SearchResult.leastPessimisticNode() followed by GameTreeNode.position().

bestMoveIndex() - Method in record class algorithm.SearchAlgorithm.SearchResult

boxHeight - Variable in class visualizer.TreeToXML

boxParamsMax - Variable in class visualizer.TreeToXML

boxParamsMin - Variable in class visualizer.TreeToXML

boxSpacingX - Variable in class visualizer.TreeToXML

boxSpacingY - Variable in class visualizer.TreeToXML

boxWidth - Variable in class visualizer.TreeToXML

BstarBasic - Class in algorithm

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

BstarBasic(StopCondition, StrategyFunction) - Constructor for class algorithm.BstarBasic

BstarBasic(StrategyFunction) - Constructor for class algorithm.BstarBasic

BstarBasicDB - Class in algorithm

Disprove-Best B*, as described in the report https://github.com/Pascalos99/ReportNewAdvancesInBstar/blob/main/Anema2025.pdf

BstarBasicDB(StopCondition, StrategyFunction, double) - Constructor for class algorithm.BstarBasicDB

BstarBasicDB(StrategyFunction, double) - Constructor for class algorithm.BstarBasicDB

bstarDB2025() - Static method in class visualizer.ExampleTrees

BstarSquaredDB - Class in algorithm

A B*² implementation which uses Disprove-Best B* at the first-level search only.

BstarSquaredDB(double, StrategyFunction) - Constructor for class algorithm.BstarSquaredDB

Uses the default StrategyFunction.PROVEBEST strategy function for L2 search.

BstarSquaredDB(double, StrategyFunction...) - Constructor for class algorithm.BstarSquaredDB

The first evaluation function provided corresponds to the function used by the first-level search.

BstarSquaredDB.L1Position<P> - Class in algorithm

BstarSquaredDB.L1Position.Settings - Class in algorithm

BstarSquaredSimple - Class in algorithm

This implements B*²-logistic with the `dispose all' bounds preservation technique and no shallow or deep irrelevance.

BstarSquaredSimple(StrategyFunction) - Constructor for class algorithm.BstarSquaredSimple

Uses the default StrategyFunction.PROVEBEST strategy function for the second-level search.

BstarSquaredSimple(StrategyFunction...) - Constructor for class algorithm.BstarSquaredSimple

The first evaluation function provided corresponds to the function used by the first-level search.

BstarSquaredSimple.L1Position<P> - Class in algorithm

BstarSquaredSimple.L1Position.Settings - Class in algorithm

BstarSquaredSimpleMax - Class in algorithm

This implements B*²-max with the `dispose all' bounds preservation technique and no shallow or deep irrelevance.

BstarSquaredSimpleMax(StrategyFunction) - Constructor for class algorithm.BstarSquaredSimpleMax

Uses the default StrategyFunction.PROVEBEST strategy function for the second-level search.

BstarSquaredSimpleMax(StrategyFunction...) - Constructor for class algorithm.BstarSquaredSimpleMax

The first evaluation function provided corresponds to the function used by the first-level search.

BstarSquaredSimpleMax.L1Position<P> - Class in algorithm

BstarSquaredSimpleMax.L1Position.Settings - Class in algorithm

BstarSquaredVariant - Class in algorithm

Deprecated.

BstarSquaredVariant(StrategyFunction) - Constructor for class algorithm.BstarSquaredVariant

Deprecated.

Uses the default StrategyFunction.PROVEBEST strategy function for L2 search.

BstarSquaredVariant(StrategyFunction...) - Constructor for class algorithm.BstarSquaredVariant

Deprecated.

BstarSquaredVariant.L1Position<P> - Class in algorithm

Deprecated.

BstarSquaredVariant.L1Position.Settings - Class in algorithm

Deprecated.

BY_SUBTREE_EXPANSIONS(int, boolean, double) - Static method in interface algorithm.StrategyFunction

BY_SUBTREE_MAXSIZE(int, boolean, double) - Static method in interface algorithm.StrategyFunction

BY_SUBTREE_PARAMS(int, boolean, ToDoubleFunction<MetricKeeper>, ToDoubleFunction<MetricKeeper>) - Static method in interface algorithm.StrategyFunction

BY_SUBTREE_SIZE(int, boolean, double) - Static method in interface algorithm.StrategyFunction

BYTES_PER_ENTRY - Static variable in class algorithm.Table

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

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