Uses of Interface
algorithm.SearchAlgorithm.SearchWithTree

Packages that use SearchAlgorithm.SearchWithTree

Package	Description
algorithm	Search techniques based on B* and various utility classes used primarily by these search techniques.

Uses of SearchAlgorithm.SearchWithTree in algorithm

Classes in algorithm that implement SearchAlgorithm.SearchWithTree

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